Struct rs_graph::linkedlistgraph::EdgeIt

pub struct EdgeIt<ID>(_);

An iterator over all edges of a linked list graph.

This iterator only returns the forward edges.

Trait Implementations

impl<ID: Clone> Clone for EdgeIt<ID>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID> where
    ID: 'a + 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<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized,