Struct rs_graph::adjacencies::FilterAdjacencies

pub struct FilterAdjacencies<A, P>(_, _);

Trait Implementations

impl<'a, A, P> Adjacencies<'a> for FilterAdjacencies<A, P> where
    A: Adjacencies<'a>,
    P: 'a + Clone + for<'r> Fn(&'r (A::Edge, A::Node)) -> bool, 

type Incidence = Filtered<A::Incidence>

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, A, P> GraphType<'a> for FilterAdjacencies<A, P> where
    A: Adjacencies<'a>, 

type Node = A::Node

Type of a node.

type Edge = A::Edge

Type of an edge.