Trait petgraph::visit::EdgeIndexable

pub trait EdgeIndexable: GraphBase {
    fn edge_bound(&self) -> usize;
    fn to_index(&self, a: Self::EdgeId) -> usize;
    fn from_index(&self, i: usize) -> Self::EdgeId;
}

The graph’s NodeIds map to indices

Required Methods

fn edge_bound(&self) -> usize

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

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

Convert a to an integer index.

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

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

Implementations on Foreign Types

impl<'a, G> EdgeIndexable for &'a Gwhere
    G: EdgeIndexable,

fn edge_bound(&self) -> usize

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

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

Implementors

impl<'a, G> EdgeIndexable for Frozen<'a, G>where
    G: EdgeIndexable,

impl<G> EdgeIndexable for Reversed<G>where
    G: EdgeIndexable,

impl<G, F> EdgeIndexable for EdgeFiltered<G, F>where
    G: EdgeIndexable,

impl<G, F> EdgeIndexable for NodeFiltered<G, F>where
    G: EdgeIndexable,

impl<N, E, Ty> EdgeIndexable for GraphMap<N, E, Ty>where
    N: NodeTrait,
    Ty: EdgeType,

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

impl<N, E, Ty, Ix> EdgeIndexable for StableGraph<N, E, Ty, Ix>where
    Ty: EdgeType,
    Ix: IndexType,