Trait petgraph::visit::NodeCompactIndexable

source ·
pub trait NodeCompactIndexable: NodeIndexable + NodeCount { }
Expand description

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().

Implementations on Foreign Types§

source§

impl<'a, G> NodeCompactIndexable for &'a G

Implementors§

source§

impl<'a, G> NodeCompactIndexable for Frozen<'a, G>

source§

impl<E, Ix: IndexType> NodeCompactIndexable for List<E, Ix>

source§

impl<G> NodeCompactIndexable for Reversed<G>

source§

impl<G, F> NodeCompactIndexable for EdgeFiltered<G, F>

source§

impl<N, E, Ty, Ix> NodeCompactIndexable for Csr<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

source§

impl<N, E, Ty, Ix> NodeCompactIndexable for Graph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,