Trait petgraph::visit::NodeIndexable

pub trait NodeIndexable: GraphBase {
    // Required methods
    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

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

Convert a to an integer index.

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

Convert i to a node index. i must be a valid value in the graph.

Object Safety

This trait is not object safe.

Implementations on Foreign Types

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

where G: NodeIndexable,

fn node_bound(&self) -> usize

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

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

Implementors

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

where G: NodeIndexable,

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

impl<G> NodeIndexable for Reversed<G>

where G: NodeIndexable,

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

where G: NodeIndexable,

impl<G, F> NodeIndexable for NodeFiltered<G, F>

where G: NodeIndexable,

impl<N, E, Ty, Ix> NodeIndexable for Csr<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

impl<N, E, Ty, Ix> NodeIndexable for Graph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

impl<N, E, Ty, Ix> NodeIndexable for StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

impl<N, E, Ty, S> NodeIndexable for GraphMap<N, E, Ty, S>

where N: NodeTrait, Ty: EdgeType, S: BuildHasher,

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