Struct rs_graph::adjacencies::OutEdges [−][src]
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>, [src]
impl<'a, 'g: 'a, G> Adjacencies<'a> for OutEdges<'g, G> where
G: Directed<'g>, [src]type IncidenceIt = AdjacenciesWrapIt<G::OutIt>
fn neigh_iter(&self, u: Self::Node) -> Self::IncidenceIt[src]
fn neighs<'b>(&'b self, u: Self::Node) -> GraphIter<'b, Self, Self::IncidenceIt>ⓘ where
'a: 'b,
Self: Sized, [src]
'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, [src]
Self: Sized,
P: for<'r> Fn(&'r (Self::Edge, Self::Node)) -> bool,
impl<'g, G, I> GraphIterator<OutEdges<'g, G>> for AdjacenciesWrapIt<I> where
I: GraphIterator<G>, [src]
impl<'g, G, I> GraphIterator<OutEdges<'g, G>> for AdjacenciesWrapIt<I> where
I: GraphIterator<G>, [src]Auto Trait Implementations
impl<'g, G> RefUnwindSafe for OutEdges<'g, G> where
G: RefUnwindSafe,
G: RefUnwindSafe,
impl<'g, G> Send for OutEdges<'g, G> where
G: Sync,
G: Sync,
impl<'g, G> Sync for OutEdges<'g, G> where
G: Sync,
G: Sync,
impl<'g, G> Unpin for OutEdges<'g, G>
impl<'g, G> UnwindSafe for OutEdges<'g, G> where
G: RefUnwindSafe,
G: RefUnwindSafe,