Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
Graph::Traversal::DFS(User Contributed Perl DocumentatGraph::Traversal::DFS(3)

NAME
       Graph::Traversal::DFS - depth-first traversal of	graphs

SYNOPSIS
	   use Graph;
	   my $g = Graph->new;
	   $g->add_edge(...);
	   use Graph::Traversal::DFS;
	   my $d = Graph::Traversal::DFS->new($g, %opt);
	   $d->dfs; # Do the traversal.

DESCRIPTION
       With 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.  Returns all vertices
	   traversed in	post-order.

SEE ALSO
       Graph::Traversal, Graph::Traversal::BFS,	Graph.

perl v5.24.1			  2013-05-24	      Graph::Traversal::DFS(3)

NAME | SYNOPSIS | DESCRIPTION | SEE ALSO

Want to link to this manual page? Use this URL:
<https://www.freebsd.org/cgi/man.cgi?query=Graph::Traversal::DFS&sektion=3&manpath=FreeBSD+12.0-RELEASE+and+Ports>

home | help