Struct daggy::petgraph::DfsIter

pub struct DfsIter<'a, G> where G: 'a + Visitable {
    // some fields omitted
}

An iterator for a depth first traversal of a graph.

Methods

impl<'a, G> DfsIter<'a, G> where G: Visitable

fn new(graph: &'a G, start: G::NodeId) -> DfsIter<'a, G>

fn move_to(&mut self, start: G::NodeId)

Keep the discovered map, but clear the visit stack and restart the DFS traversal from a particular node.

Trait Implementations

impl<'a, G> Iterator for DfsIter<'a, G> where G: 'a + Visitable + NeighborIter<'a>

type Item = G::NodeId

fn next(&mut self) -> Option<G::NodeId>

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

impl<'a, G> Clone for DfsIter<'a, G> where G: Visitable, Dfs<G::NodeId, G::Map>: Clone

fn clone(&self) -> DfsIter<'a, G>

Returns a copy of the value.

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

Performs copy-assignment from source.