Trait petgraph::visit::NodeCompactIndexable [] [src]

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

Implementations on Foreign Types

impl<'a, G> NodeCompactIndexable for &'a G where
    G: NodeCompactIndexable
[src]

Implementors