1Graph::Traversal::DFS(3U)ser Contributed Perl DocumentatiGornaph::Traversal::DFS(3)
2
3
4

NAME

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

SYNOPSIS

9           use Graph;
10           my $g = Graph->new;
11           $g->add_edge(...);
12           use Graph::Traversal::DFS;
13           my $d = Graph::Traversal::DFS->new($g, %opt);
14           $d->dfs; # Do the traversal.
15

DESCRIPTION

17       With this class one can traverse a Graph in depth-first order.
18
19       The callback parameters %opt are explained in Graph::Traversal.
20
21   Methods
22       The following methods are available:
23
24       dfs Traverse the graph in depth-first order.  Returns all vertices
25           traversed in post-order.
26

SEE ALSO

28       Graph::Traversal, Graph::Traversal::BFS, Graph.
29
30
31
32perl v5.28.0                      2014-03-09          Graph::Traversal::DFS(3)