Struct rs_graph::adjacencies::InEdges

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

Neighbor access over all incoming edges of a Digraph.

Tuple Fields

0: &'g G

Trait Implementations

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

type Node = <G as GraphType>::Node<'a>

type Edge = <G as GraphType>::Edge<'a>

type IncidenceIt = AdjacenciesWrapIt<<G as Directed>::InIt<'a>>

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

fn neighs<'b>(&'b self, u: Self::Node) -> GraphIter<'b, Self, Self::IncidenceIt> where Self: Sized, 'a: 'b,

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 as GraphIterator<G>>::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(self, g: &G) -> GraphIter<'_, G, Self> where G: Sized,