Graph::Traversal::BFS - breadth-first traversal of graphs River stage three • 77 direct dependents • 139 total dependents

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: bfs Traverse the graph in breadth-first order. Returns all vertices traverse...

ETJ/Graph-0.9725 - 10 Oct 2021 20:06:24 UTC

Graph::Traversal::DFS - depth-first traversal of graphs River stage three • 77 direct dependents • 139 total dependents

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...

ETJ/Graph-0.9725 - 10 Oct 2021 20:06:24 UTC

Graph::Simple - simple and intuitive interface for manipulating graph River stage zero No dependents

In computer science, a graph is an abstract data type that is meant to implement the graph and hypergraph concepts from mathematics. A graph data structure consists of a finite (and possibly mutable) set of ordered pairs, called *edges*, of certain e...

SUKRIA/Graph-Simple-0.04 - 14 Sep 2013 09:42:17 UTC

Graph::Traversal - traverse graphs River stage three • 77 direct dependents • 139 total dependents

You can control how the graph is traversed by the various callback parameters in the %opt. In the parameters descriptions below the $u and $v are vertices, and the $self is the traversal object itself. Callback parameters The following callback param...

ETJ/Graph-0.9725 - 10 Oct 2021 20:06:24 UTC

Graph::Implicit - graph algorithms for implicitly specified graphs River stage zero No dependents

This module implements several graph algorithms (for directed, weighted graphs) that can run without having to specify the actual graph. This module models a graph as an arbitrary coderef that maps vertices onto a list of adjacent vertices and weight...

DOY/Graph-Implicit-0.03 - 28 Sep 2009 00:57:34 UTC
5 results (0.032 seconds)