Trait petgraph::visit::NodeCompactIndexable

pub trait NodeCompactIndexable: NodeIndexable { }

The graph’s NodeIds map to indices, in a range without holes.

The graph's node identifiers correspond to exactly the indices 0..self.node_bound().

Implementors

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