NAME¶

Graph::Traversal::DFS - depth-first traversal of graphs

SYNOPSIS¶

    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.

DESCRIPTION¶

With this class one can traverse a Graph in depth-first order.

The callback parameters %opt are explained in Graph::Traversal.

SEE ALSO¶

Graph::Traversal, Graph::Traversal::BFS, Graph.