Trait rs_graph::graph::IndexNetwork
[−]
[src]
pub trait IndexNetwork<'a>: IndexGraph<'a> + Network<'a> { fn biedge_id(&self, e: Self::Edge) -> usize; fn id2biedge(&'a self, id: usize) -> Self::Edge; }
Associates edges with unique ids for forward and backward edge.
There are no guarantees on the relation between edge and node ids.
Required Methods
fn biedge_id(&self, e: Self::Edge) -> usize
Return a unique id associated with a directed edge.
The returned id must be different for the edge and its reverse edge.
fn id2biedge(&'a self, id: usize) -> Self::Edge
Return the edge associated with the given id.
The method panics if the id is invalid.
Implementations on Foreign Types
impl<'a, G> IndexNetwork<'a> for &'a G where
G: IndexNetwork<'a>,
[src]
G: IndexNetwork<'a>,
Implementors
impl<'a, G> IndexNetwork<'a> for ReverseDigraph<G> where
G: IndexNetwork<'a>,impl<'a, G, Gx, Nx, Ex, Ax> IndexNetwork<'a> for Attributed<G, Gx, Nx, Ex, Ax> where
G: IndexNetwork<'a>,
Gx: Default,
Nx: Default,
Ex: Default,
Ax: Default,impl<'a, ID> IndexNetwork<'a> for LinkedListGraph<ID> where
ID: 'a + PrimInt + Unsigned,