Trait petgraph::visit::NodeCompactIndexable

pub trait NodeCompactIndexable: NodeIndexable + NodeCount { }

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<G, F> NodeCompactIndexable for EdgeFiltered<G, F> where G: NodeCompactIndexable
• impl<G> NodeCompactIndexable for Reversed<G> where G: NodeCompactIndexable
• 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
• impl<N, E, Ty> NodeCompactIndexable for GraphMap<N, E, Ty> where N: NodeTrait, Ty: EdgeType
• impl<'a, G> NodeCompactIndexable for Frozen<'a, G> where G: NodeCompactIndexable
• impl<N, E, Ty> NodeCompactIndexable for Csr<N, E, Ty> where Ty: EdgeType