Trait rs_graph::traits::refs::IndexGraphRef

pub trait IndexGraphRef<'a>: UndirectedRef<'a> {
    // 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;
}

A reference to an indexed graph.

This trait contains methods with a unrestricted lifetime for self.

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<'a, G> IndexGraphRef<'a> for NonNull<G>where G: IndexGraph + 'a,

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<'a, G> IndexGraphRef<'a> for &'a 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

Implementors

impl<'a, G> IndexGraphRef<'a> for Network<'a, G>where G: IndexGraph,

impl<'a, G> IndexGraphRef<'a> for ReverseDigraph<'a, G>where G: IndexGraphRef<'a>,