Trait petgraph::visit::NodeCompactIndexable [−][src]
pub trait NodeCompactIndexable: NodeIndexable + NodeCount { }
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
impl<'a, G> NodeCompactIndexable for &'a G where
G: NodeCompactIndexable,
[src]
Loading content...G: NodeCompactIndexable,
Implementors
impl<'a, G> NodeCompactIndexable for Frozen<'a, G> where
G: NodeCompactIndexable,
[src]
G: NodeCompactIndexable,
impl<G> NodeCompactIndexable for Reversed<G> where
G: NodeCompactIndexable,
[src]
G: NodeCompactIndexable,
impl<G, F> NodeCompactIndexable for EdgeFiltered<G, F> where
G: NodeCompactIndexable,
[src]
G: NodeCompactIndexable,
impl<N, E, Ty> NodeCompactIndexable for GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
[src]
N: NodeTrait,
Ty: EdgeType,
impl<N, E, Ty, Ix> NodeCompactIndexable for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> NodeCompactIndexable for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,