Struct rs_graph::adjacencies::OutEdges

pub struct OutEdges<'g, G>(pub &'g G);

Neighbor access over all outgoing edges of a Digraph.

Trait Implementations

impl<'a, 'g: 'a, G> Adjacencies<'a> for OutEdges<'g, G> where
    G: Directed<'g>, 

type Incidence = G::OutEdge

fn first(&self, u: Self::Node) -> Option<Self::Incidence>

fn next(&self, it: Self::Incidence) -> Option<Self::Incidence>

fn get(&self, it: &Self::Incidence) -> (Self::Edge, Self::Node)

Important traits for IncidenceIter<'a, 'g, G>

impl<'a: 'g, 'g, G> Iterator for IncidenceIter<'a, 'g, G> where
    G: Adjacencies<'a>,  type Item = (G::Edge, G::Node);

fn neighs<'g>(&'g self, u: Self::Node) -> IncidenceIter<'a, 'g, Self> where
    Self: Sized, 

fn filter<P>(self, predicate: P) -> FilterAdjacencies<Self, P> where
    Self: Sized,
    P: for<'r> Fn(&'r (Self::Edge, Self::Node)) -> bool, 

impl<'a, 'g: 'a, G> GraphType<'a> for OutEdges<'g, G> where
    G: Directed<'g>, 

type Node = G::Node

Type of a node.

type Edge = G::Edge

Type of an edge.