Query: graph::traversal::dfs
OS: debian
Section: 3pm
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
Graph::Traversal::DFS(3pm) User Contributed Perl Documentation Graph::Traversal::DFS(3pm)NAMEGraph::Traversal::DFS - depth-first traversal of graphsSYNOPSISuse Graph; my $g = Graph->new; $g->add_edge(...); use Graph::Traversal::DFS; my $d = Graph::Traversal::DFS->new(%opt); $d->dfs; # Do the traversal.DESCRIPTIONWith 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.SEE ALSOGraph::Traversal, Graph::Traversal::BFS, Graph. perl v5.10.0 2004-10-30 Graph::Traversal::DFS(3pm)
Related Man Pages |
---|
graph::easy::group::cell(3pm) - debian |
graph::easy::layout(3pm) - debian |
graph::reader::xml(3pm) - debian |
graph::unionfind(3pm) - debian |
graph::writer::xml(3pm) - debian |
Similar Topics in the Unix Linux Community |
---|
Adding the individual columns of a matrix. |
awk or sed - Convert 2 lines to 1 line |
Detecting unused variables... |
One instance of comparing grep and awk |
A (ksh) Library For and From UNIX.com |