Graph::Traversal::BFS man page on Fedora

Graph::Traversal::BFS man page on Fedora

Man page or keyword search:
man Server 31170 pages
apropos Keyword Search (all sections)
Output format

Graph::Traversal::BFS(User Contributed Perl DocumentatGraph::Traversal::BFS(3)

NAME
       Graph::Traversal::BFS - breadth-first traversal of graphs

SYNOPSIS
	   use Graph;
	   my $g = Graph->new;
	   $g->add_edge(...);
	   use Graph::Traversal::BFS;
	   my $b = Graph::Traversal::BFS->new(%opt);
	   $b->bfs; # Do the traversal.

DESCRIPTION
       With 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 ALSO
       Graph::Traversal, Graph::Traversal::DFS, Graph.

perl v5.14.0			  2004-10-30	      Graph::Traversal::BFS(3)

[top]

List of man pages available for Fedora

Copyright (c) for man pages and the logo by the respective OS vendor.

For those who want to learn more, the polarhome community provides shell access and support.

[legal] [privacy] [GNU] [policy] [cookies] [netiquette] [sponsors] [FAQ]

Polarhome, production since 1999.
Member of Polarhome portal.
Based on Fawad Halim's script.
....................................................................

Vote for polarhome