Struct rs_graph::adjacencies::InEdges

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

Neighbor access over all incoming edges of a Digraph.

Trait Implementations

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

type IncidenceIt = AdjacenciesWrapIt<G::InIt>

fn neigh_iter(&self, u: Self::Node) -> Self::IncidenceIt

fn neighs<'b>(&'b self, u: Self::Node) -> GraphIter<'b, Self, Self::IncidenceIt> where
    'a: 'b,
    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<'g, G, I> GraphIterator<InEdges<'g, G>> for AdjacenciesWrapIt<I> where
    I: GraphIterator<G>, 

type Item = I::Item

fn next(&mut self, adj: &InEdges<'g, G>) -> Option<Self::Item>

fn size_hint(&self, adj: &InEdges<'g, G>) -> (usize, Option<usize>)

fn count(self, adj: &InEdges<'g, G>) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized, 

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

type Node = G::Node

Type of a node.

type Edge = G::Edge

Type of an edge.