Trait GraphAlgorithms

pub trait GraphAlgorithms {
    // Required methods
    fn components(&self) -> Vec<VertexSet> ;
    fn degeneracy(&self) -> (u32, u32, Vec<Vertex>, VertexMap<u32>);
    fn is_bipartite(&self) -> BipartiteWitness;
}

Implements various basic graph algorithms for the Graph trait.

Required Methods

fn components(&self) -> Vec<VertexSet>

Returns the connected components of this graph.

fn degeneracy(&self) -> (u32, u32, Vec<Vertex>, VertexMap<u32>)

Computes the degeneracy (approximate), core-numbers and a degeneracy-ordering of this graph. The return value contains four values:

1. A lower bound on the degeneracy,
2. an upper bound on the degeneracy,
3. the computed degeneracy ordering, and
4. the core-numbers of each vertex in this ordering.

fn is_bipartite(&self) -> BipartiteWitness

Tests whether the graph is bipartite and returns a witness.

Implementors

impl<G> GraphAlgorithms for G

where G: Graph,