Trait petgraph::visit::NodeIndexable

pub trait NodeIndexable: GraphBase {
    fn node_bound(&self) -> usize;
    fn to_index(a: Self::NodeId) -> usize;
}

The graph’s NodeIds map to indices

Required Methods

fn node_bound(&self) -> usize

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap).

fn to_index(a: Self::NodeId) -> usize

Convert a to an integer index.

Implementors

• impl<N, E, Ty, Ix> NodeIndexable for StableGraph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, G> NodeIndexable for &'a G where G: NodeIndexable
• impl<N, E, Ty, Ix> NodeIndexable for Graph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType