Trait petgraph::visit::NodeCompactIndexable [−][src]
pub trait NodeCompactIndexable: NodeIndexable + NodeCount { }
Expand description
The graph’s NodeId
s map to indices, in a range without holes.
The graph’s node identifiers correspond to exactly the indices
0..self.node_bound()
.
Implementations on Foreign Types
Implementors
impl<N, E, Ty, Ix> NodeCompactIndexable for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> NodeCompactIndexable for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,