Graph::Traversal::DFS3pm
Depth-first traversal of graphs
Usage
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.
Overview
With this class one can traverse a Graph in depth-first order.
The callback parameters %opt are explained in Graph::Traversal.
Methods
The following methods are available:
- dfs
-
Traverse the graph in depth-first order. Returns all vertices traversed in post-order.
Releases
10 releases since Debian 4.0 (Etch); the text changed 7 times.