Struct HashMapGraph 

pub struct HashMapGraph { /* private fields */ }

Implementations

impl HashMapGraph

pub fn has_vertex(&self, u: usize) -> bool

pub fn neighborhood_set(&self, u: usize) -> &FxHashSet<usize>

pub fn dfs(&self, u: usize) -> HashMapGraphDfs<'_>

pub fn find_cut_vertex(&self) -> Option<FxHashSet<usize>>

pub fn find_safe_bi_connected_separator(&self) -> Option<FxHashSet<usize>>

pub fn connected_components(&self) -> Vec<FxHashSet<usize>>

pub fn find_safe_tri_connected_separator(&self) -> Option<FxHashSet<usize>>

pub fn find_minor_safe_separator( &self, tree_decomposition: Option<TreeDecomposition>, seed: Option<u64>, max_tries: usize, max_missing: usize, use_min_degree: bool, ) -> Option<MinorSafeResult>

pub fn vertex_induced(&self, vertices: &FxHashSet<usize>) -> Self

pub fn find_almost_clique_minimal_separator(&self) -> Option<FxHashSet<usize>>

pub fn find_clique_minimal_separator(&self) -> Option<FxHashSet<usize>>

pub fn separate(&self, separator: &FxHashSet<usize>) -> Vec<FxHashSet<usize>>

pub fn vertex_induced_subgraph(&self, vertex_set: &FxHashSet<usize>) -> Self

impl HashMapGraph

pub fn from_graph<G: BaseGraph>(graph: &G) -> Self

Trait Implementations

impl BaseGraph for HashMapGraph

fn degree(&self, u: usize) -> usize

fn order(&self) -> usize

fn is_clique(&self, vertices: &[usize]) -> bool

fn is_neighborhood_clique(&self, u: usize) -> bool

fn has_edge(&self, u: usize, v: usize) -> bool

fn is_simplicial(&self, u: usize) -> bool

fn is_almost_simplicial(&self, u: usize) -> bool

fn vertices(&self) -> Box<dyn Iterator<Item = usize> + '_>

fn neighborhood(&self, u: usize) -> Box<dyn Iterator<Item = usize> + '_>

fn fill_in_count(&self, u: usize) -> usize

fn min_vertex_by<F: FnMut(&usize, &usize) -> Ordering>( &self, cmp: F, ) -> Option<usize>

fn max_vertex_by<F: FnMut(&usize, &usize) -> Ordering>( &self, cmp: F, ) -> Option<usize>

fn min_neighbor_by<F: FnMut(&usize, &usize) -> Ordering>( &self, u: usize, cmp: F, ) -> Option<usize>

fn max_neighbor_by<F: FnMut(&usize, &usize) -> Ordering>( &self, u: usize, cmp: F, ) -> Option<usize>

impl Clone for HashMapGraph

fn clone(&self) -> HashMapGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for HashMapGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl From<HashMapGraph> for MinFillDegreeSelector

fn from(graph: HashMapGraph) -> Self

Converts to this type from the input type.

impl From<HashMapGraph> for MinDegreeSelector

fn from(graph: HashMapGraph) -> Self

Converts to this type from the input type.

impl From<HashMapGraph> for MinFillSelector

fn from(graph: HashMapGraph) -> Self

Converts to this type from the input type.

impl MutableGraph for HashMapGraph

fn add_vertex(&mut self, u: usize)

fn add_vertex_with_capacity(&mut self, u: usize, capacity: usize)

fn remove_vertex(&mut self, u: usize)

fn add_edge(&mut self, u: usize, v: usize)

fn remove_edge(&mut self, u: usize, v: usize)

fn eliminate_vertex(&mut self, u: usize)

fn contract(&mut self, u: usize, v: usize)

fn new() -> Self

fn with_capacity(capacity: usize) -> Self

fn make_clique(&mut self, vertices: &[usize])

impl<T: BufRead> TryFrom<PaceReader<T>> for HashMapGraph

type Error = Error

The type returned in the event of a conversion error.

fn try_from(reader: PaceReader<T>) -> Result<Self, Self::Error>

Performs the conversion.