Man Page: graph::traversal::bfs
Operating Environment: debian
Section: 3pm
Graph::Traversal::BFS(3pm) User Contributed Perl Documentation Graph::Traversal::BFS(3pm)NAMEGraph::Traversal::BFS - breadth-first traversal of graphsSYNOPSISuse Graph; my $g = Graph->new; $g->add_edge(...); use Graph::Traversal::BFS; my $b = Graph::Traversal::BFS->new(%opt); $b->bfs; # Do the traversal.DESCRIPTIONWith this class one can traverse a Graph in breadth-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::DFS, Graph. perl v5.10.0 2004-10-30 Graph::Traversal::BFS(3pm)
| Similar Topics in the Unix Linux Community |
|---|
| How can I do this in VI editor? |
| Is UNIX an open source OS ? |
| One instance of comparing grep and awk |
| Weird 'find' results |
| A (ksh) Library For and From UNIX.com |