Trait rs_graph::traits::IndexGraph

pub trait IndexGraph: Graph {
    // Required methods
    fn node_id(&self, u: Self::Node<'_>) -> usize;
    fn id2node(&self, id: usize) -> Self::Node<'_>;
    fn edge_id(&self, e: Self::Edge<'_>) -> usize;
    fn id2edge(&self, id: usize) -> Self::Edge<'_>;
}

Associates nodes and edges with unique ids.

Required Methods

fn node_id(&self, u: Self::Node<'_>) -> usize

Return a unique id associated with a node.

fn id2node(&self, id: usize) -> Self::Node<'_>

Return the node associated with the given id.

The method panics if the id is invalid.

fn edge_id(&self, e: Self::Edge<'_>) -> usize

Return a unique id associated with an edge.

The returned id is the same for the edge and its reverse edge.

fn id2edge(&self, id: usize) -> Self::Edge<'_>

Return the edge associated with the given id.

The method returns the forward edge.

The method panics if the id is invalid.

Implementations on Foreign Types

impl<'g, G> IndexGraph for &'g Gwhere G: IndexGraph,

fn node_id(&self, u: Self::Node<'_>) -> usize

fn edge_id(&self, e: Self::Edge<'_>) -> usize

fn id2node(&self, id: usize) -> Self::Node<'_>

fn id2edge(&self, id: usize) -> Self::Edge<'_>

impl<G> IndexGraph for Rc<G>where G: IndexGraph,

fn node_id(&self, u: Self::Node<'_>) -> usize

fn edge_id(&self, e: Self::Edge<'_>) -> usize

fn id2node(&self, id: usize) -> Self::Node<'_>

fn id2edge(&self, id: usize) -> Self::Edge<'_>

Implementors

impl<'g, G> IndexGraph for Network<'g, G>where G: IndexGraph,

impl<'g, G> IndexGraph for ReverseDigraph<'g, G>where G: IndexGraph,

impl<ID> IndexGraph for VecGraph<ID>where ID: PrimInt + Unsigned + 'static,

impl<ID, N, E> IndexGraph for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,