Struct rs_graph::adjacencies::Neighbors [−][src]
pub struct Neighbors<'g, G>(pub &'g G);
Neighbor access over all adjacent (undirected) edges.
Trait Implementations
impl<'a, 'g: 'a, G> Adjacencies<'a> for Neighbors<'g, G> where
G: Undirected<'g>,
[src]
impl<'a, 'g: 'a, G> Adjacencies<'a> for Neighbors<'g, G> where
G: Undirected<'g>,
[src]type IncidenceIt = AdjacenciesWrapIt<G::NeighIt>
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<Neighbors<'g, G>> for AdjacenciesWrapIt<I> where
I: GraphIterator<G>,
[src]
impl<'g, G, I> GraphIterator<Neighbors<'g, G>> for AdjacenciesWrapIt<I> where
I: GraphIterator<G>,
[src]Auto Trait Implementations
impl<'g, G> RefUnwindSafe for Neighbors<'g, G> where
G: RefUnwindSafe,
impl<'g, G> RefUnwindSafe for Neighbors<'g, G> where
G: RefUnwindSafe,
impl<'g, G> UnwindSafe for Neighbors<'g, G> where
G: RefUnwindSafe,
impl<'g, G> UnwindSafe for Neighbors<'g, G> where
G: RefUnwindSafe,