Struct rs_graph::linkedlistgraph::NodeIt [−][src]
pub struct NodeIt<ID>(_);
A graph iterator over all nodes of a linked list graph.
Trait Implementations
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]type Item = Node<ID>
fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>
[src]
fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)
[src]
fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize
[src]
fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘ where
G: Sized,
[src]
G: Sized,
Auto Trait Implementations
impl<ID> RefUnwindSafe for NodeIt<ID> where
ID: RefUnwindSafe,
impl<ID> RefUnwindSafe for NodeIt<ID> where
ID: RefUnwindSafe,
impl<ID> UnwindSafe for NodeIt<ID> where
ID: UnwindSafe,
impl<ID> UnwindSafe for NodeIt<ID> where
ID: UnwindSafe,