Graph::Traversal::DFS - depth-first traversal of graphs
use Graph; my $g = Graph->new; $g->add_edge(...); use Graph::Traversal::DFS; my $d = Graph::Traversal::DFS->new($g, %opt); $d->dfs; # Do the traversal.
With this class one can traverse a Graph in depth-first order.
The callback parameters %opt are explained in Graph::Traversal.
The following methods are available:
Traverse the graph in depth-first order. Returns all vertices traversed in post-order.