Struct rs_graph::adjacencies::Neighbors
source · pub struct Neighbors<'g, G>(pub &'g G);
Expand description
Neighbor access over all adjacent (undirected) edges.
Tuple Fields§
§0: &'g G
Trait Implementations§
source§impl<'a, 'g: 'a, G> Adjacencies<'a> for Neighbors<'g, G>where
G: Undirected,
impl<'a, 'g: 'a, G> Adjacencies<'a> for Neighbors<'g, G>where G: Undirected,
type Node = <G as GraphType>::Node<'a>
type Edge = <G as GraphType>::Edge<'a>
type IncidenceIt = AdjacenciesWrapIt<<G as Undirected>::NeighIt<'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,
source§impl<'g, G, I> GraphIterator<Neighbors<'g, G>> for AdjacenciesWrapIt<I>where
I: GraphIterator<G>,
impl<'g, G, I> GraphIterator<Neighbors<'g, G>> for AdjacenciesWrapIt<I>where I: GraphIterator<G>,
type Item = <I as GraphIterator<G>>::Item
fn next(&mut self, adj: &Neighbors<'g, G>) -> Option<Self::Item>
fn size_hint(&self, adj: &Neighbors<'g, G>) -> (usize, Option<usize>)
fn count(self, adj: &Neighbors<'g, G>) -> usize
fn iter(self, g: &G) -> GraphIter<'_, G, Self> ⓘwhere G: Sized,
Auto Trait Implementations§
impl<'g, G> RefUnwindSafe for Neighbors<'g, G>where G: RefUnwindSafe,
impl<'g, G> Send for Neighbors<'g, G>where G: Sync,
impl<'g, G> Sync for Neighbors<'g, G>where G: Sync,
impl<'g, G> Unpin for Neighbors<'g, G>
impl<'g, G> UnwindSafe for Neighbors<'g, G>where G: RefUnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more