Graph::Traversal::BFS − breadth−first traversal of graphs
use Graph;
my $g = Graph−>new;
$g−>add_edge(...);
use Graph::Traversal::BFS;
my $b = Graph::Traversal::BFS−>new($g, %opt);
$b−>bfs; # Do the traversal.
With this class one can traverse a Graph in breadth-first order.
The callback parameters %opt are explained in Graph::Traversal.
The following methods are available:
|
bfs |
Traverse the graph in breadth-first order. Returns all vertices traversed in post-order. |
Graph::Traversal, Graph::Traversal::DFS, Graph.