[][src]Trait rs_graph::traits::refs::DirectedRef

pub trait DirectedRef<'a>: Directed<'a> + UndirectedRef<'a> {
    fn src(&self, e: Self::Edge) -> Self::Node;
fn snk(&self, e: Self::Edge) -> Self::Node;
fn first_out(&self, u: Self::Node) -> Option<Self::OutEdge>;
fn next_out(&self, it: Self::OutEdge) -> Option<Self::OutEdge>;
fn get_out(&self, it: &Self::OutEdge) -> (Self::Edge, Self::Node);
fn first_in(&self, u: Self::Node) -> Option<Self::InEdge>;
fn next_in(&self, it: Self::InEdge) -> Option<Self::InEdge>;
fn get_in(&self, it: &Self::InEdge) -> (Self::Edge, Self::Node);
fn first_incident(&self, u: Self::Node) -> Option<Self::IncidentEdge>;
fn next_incident(
        &self,
        it: Self::IncidentEdge
    ) -> Option<Self::IncidentEdge>;
fn get_incident(
        &self,
        it: &Self::IncidentEdge
    ) -> (Self::DirectedEdge, Self::Node); }

A reference to a digraph.

This trait contains methods with a unrestricted lifetime for self.

Required methods

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

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

fn first_out(&self, u: Self::Node) -> Option<Self::OutEdge>

fn next_out(&self, it: Self::OutEdge) -> Option<Self::OutEdge>

fn get_out(&self, it: &Self::OutEdge) -> (Self::Edge, Self::Node)

fn first_in(&self, u: Self::Node) -> Option<Self::InEdge>

fn next_in(&self, it: Self::InEdge) -> Option<Self::InEdge>

fn get_in(&self, it: &Self::InEdge) -> (Self::Edge, Self::Node)

fn first_incident(&self, u: Self::Node) -> Option<Self::IncidentEdge>

fn next_incident(&self, it: Self::IncidentEdge) -> Option<Self::IncidentEdge>

fn get_incident(
    &self,
    it: &Self::IncidentEdge
) -> (Self::DirectedEdge, Self::Node)

Loading content...

Implementations on Foreign Types

impl<'a, G> DirectedRef<'a> for &'a G where
    G: Directed<'a>, 
[src]

Loading content...

Implementors

impl<'a, G> DirectedRef<'a> for Network<&'a G> where
    G: 'a + Directed<'a>, 
[src]

impl<'a, G> DirectedRef<'a> for ReverseDigraph<G> where
    G: DirectedRef<'a>, 
[src]

Loading content...