Trait petgraph::visit::NodeIndexable[][src]

pub trait NodeIndexable: GraphBase {
    fn node_bound(&self) -> usize;
fn to_index(&self, a: Self::NodeId) -> usize;
fn from_index(&self, i: usize) -> Self::NodeId; }

The graph’s NodeIds map to indices

Required Methods

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap).

Convert a to an integer index.

Convert i to a node index

Implementations on Foreign Types

impl<'a, G> NodeIndexable for &'a G where
    G: NodeIndexable