Struct Dfs 

pub struct Dfs<Node> { /* private fields */ }

An iterative depth-first traversal.

Implementations

impl<Node> Dfs<Node>

pub fn new(roots: impl IntoIterator<Item = Node>) -> Self

Create a new DFS traversal, starting at the given roots.

pub fn add_root(&mut self, root: Node)

Add a single new root to this traversal, to be visited immediately.

pub fn add_roots(&mut self, roots: impl IntoIterator<Item = Node>)

Add multiple new roots to this traversal, to be visited immediately.

impl<Node> Dfs<Node>

where Node: Copy,

pub fn next<G>( &mut self, graph: G, seen: impl Fn(Node) -> bool, ) -> Option<DfsEvent<Node>>

where G: Graph<Node>,

Pump the traversal, yielding the next DfsEvent.

Returns None when the traversal is complete.

Trait Implementations

impl<Node> Default for Dfs<Node>

fn default() -> Self

Returns the “default value” for a type.