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

fn node_bound(&self) -> usize[src]

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

fn to_index(&self, a: Self::NodeId) -> usize[src]

Convert a to an integer index.

fn from_index(&self, i: usize) -> Self::NodeId[src]

Convert i to a node index

Loading content...

Implementations on Foreign Types

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

Loading content...

Implementors

impl<'a, G> NodeIndexable for Frozen<'a, G> where
    G: NodeIndexable, [src]

impl<G> NodeIndexable for Reversed<G> where
    G: NodeIndexable, [src]

impl<G, F> NodeIndexable for EdgeFiltered<G, F> where
    G: NodeIndexable, [src]

impl<G, F> NodeIndexable for NodeFiltered<G, F> where
    G: NodeIndexable, [src]

impl<N, E, Ty> NodeIndexable for GraphMap<N, E, Ty> where
    N: NodeTrait,
    Ty: EdgeType, [src]

impl<N, E, Ty, Ix> NodeIndexable for Csr<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, [src]

impl<N, E, Ty, Ix> NodeIndexable for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, [src]

impl<N, E, Ty, Ix> NodeIndexable for StableGraph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, [src]

fn node_bound(&self) -> usize[src]

Return an upper bound of the node indices in the graph

impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> NodeIndexable for MatrixGraph<N, E, Ty, Null, Ix>[src]

Loading content...