The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.

Changes for version 0.9702 - 2015-09-28

  • rt.cpan.org 107394 $Storable::VERSION may contain underscores
  • follow-up to rt.cpan.org 104687: more docs, fixes, and tests for diameter/radius/shortest_path/center_vertices/vertex_eccentricity for corner cases like empty graph, single-vertex graphs, and in general unconnected graphs
  • for perl 5.22 or later one should be able to use Inf for Infinity
  • openbsd before perl 5.20 had nondeterministic rand()

Modules

graph data structures and algorithms
create and a map of graph vertices or edges
create and a map of graph vertices or edges
create and query the adjacency matrix of graph G
create and manipulate a V x V bit matrix of graph G
directed graphs
create and manipulate a V x V matrix of graph G
create and query transitive closure of graph
create and query transitive closure of graph
traverse graphs
breadth-first traversal of graphs
depth-first traversal of graphs
undirected graphs
union-find data structures
Perl extension for elements to be put in Heaps
a Perl extension for keeping data partially sorted

Provides

in lib/Graph/AdjacencyMap/Heavy.pm
in lib/Graph/AdjacencyMap/Light.pm
in lib/Graph/Attribute.pm
in lib/Graph/MSTHeapElem.pm
in lib/Graph/SPTHeapElem.pm