Struct rs_graph::linkedlistgraph::OutIt

pub struct OutIt<ID>(_);

A graph iterator over edges leaving a node.

Trait Implementations

impl<ID: Clone> Clone for OutIt<ID>

fn clone(&self) -> OutIt<ID>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for OutIt<ID> where
    ID: 'a + PrimInt + Unsigned, 

type Item = (Edge<ID>, Node<ID>)

fn next(&mut self, g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)

fn count(self, g: &G) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized,