Trait rs_graph::traits::refs::UndirectedRef

pub trait UndirectedRef<'a>: Undirected<'a> + GraphSizeRef<'a> {
    fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node);
    fn first_neigh(&self, u: Self::Node) -> Option<Self::Neigh>;
    fn next_neigh(&self, it: Self::Neigh) -> Option<Self::Neigh>;
    fn get_neigh(&self, it: &Self::Neigh) -> (Self::Edge, Self::Node);
}

A reference to an undirected graph.

This trait contains methods with a unrestricted lifetime for self.

Required methods

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

fn first_neigh(&self, u: Self::Node) -> Option<Self::Neigh>

fn next_neigh(&self, it: Self::Neigh) -> Option<Self::Neigh>

fn get_neigh(&self, it: &Self::Neigh) -> (Self::Edge, Self::Node)

Loading content...

Implementations on Foreign Types

impl<'a, G> UndirectedRef<'a> for &'a G where
    G: Undirected<'a>, 

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

fn first_neigh(&self, u: Self::Node) -> Option<Self::Neigh>

fn next_neigh(&self, it: Self::Neigh) -> Option<Self::Neigh>

fn get_neigh(&self, it: &Self::Neigh) -> (Self::Edge, Self::Node)

Loading content...

Implementors

impl<'a, G> UndirectedRef<'a> for Network<&'a G> where
    G: Directed<'a>, 

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

fn first_neigh(&self, u: Self::Node) -> Option<Self::Neigh>

fn next_neigh(&self, it: Self::Neigh) -> Option<Self::Neigh>

fn get_neigh(&self, it: &Self::Neigh) -> (Self::Edge, Self::Node)

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

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

fn first_neigh(&self, u: Self::Node) -> Option<Self::Neigh>

fn next_neigh(&self, it: Self::Neigh) -> Option<Self::Neigh>

fn get_neigh(&self, it: &Self::Neigh) -> (Self::Edge, Self::Node)

Loading content...