Struct rs_graph::linkedlistgraph::NeighIt
source · pub struct NeighIt<ID>(_);
Expand description
Graph iterator over edges incident with some node.
Trait Implementations§
source§impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID>where
ID: PrimInt + Unsigned,
impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID>where ID: PrimInt + Unsigned,
Auto Trait Implementations§
impl<ID> RefUnwindSafe for NeighIt<ID>where ID: RefUnwindSafe,
impl<ID> Send for NeighIt<ID>where ID: Send,
impl<ID> Sync for NeighIt<ID>where ID: Sync,
impl<ID> Unpin for NeighIt<ID>where ID: Unpin,
impl<ID> UnwindSafe for NeighIt<ID>where ID: UnwindSafe,
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