Struct rs_graph::linkedlistgraph::EdgeIt
source · pub struct EdgeIt<ID>(_);
Expand description
An iterator over all edges of a linked list graph.
This iterator only returns the forward edges.
Trait Implementations§
source§impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID>where
ID: PrimInt + Unsigned,
impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID>where ID: PrimInt + Unsigned,
type Item = Edge<ID>
fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>
fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)
fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize
fn iter(self, g: &G) -> GraphIter<'_, G, Self> ⓘwhere G: Sized,
Auto Trait Implementations§
impl<ID> RefUnwindSafe for EdgeIt<ID>where ID: RefUnwindSafe,
impl<ID> Send for EdgeIt<ID>where ID: Send,
impl<ID> Sync for EdgeIt<ID>where ID: Sync,
impl<ID> Unpin for EdgeIt<ID>where ID: Unpin,
impl<ID> UnwindSafe for EdgeIt<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