The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Changes for version 0.97 - 2015-09-22

  • rt.cpan.org 104687 diameter and centre of a one vertex graph
  • rt.cpan.org 107195 [PATCH] fix POD: add missing NAME header
  • rt.cpan.org 107194 [PATCH] fix a spelling mistake
  • rt.cpan.org #94046 Loading graph produces a warning with Perl 5.16.3
  • rt.cpan.org 62626 Graph::TransitiveClosure::Matrix contradictory wrt reflexive
  • rt.cpan.org 71793 Problem with APSP and default weight 1
  • rt.cpan.org 79143 Graph scalar context override causes problems
  • rt.cpan.org 92427 Graph::delete_vertex should not use _edges_at (in all cases)
  • rt.cpan.org 85238 bug in edges() method?
  • rt.cpan.org 93278 SPT_Dijkstra sometimes returns a wrong answer
  • rt.cpan.org 78465 find_a_cycle and has_cycle are broken
  • rt.cpan.org 92204 (longest path is not calculated correctly in this case)
  • rt.cpan.org 65497 induced subgraph method
  • plus various doc and code nits found while looking at the above

Changes for version 0.96_01 - 2014-03-09

  • Taken over maintenance from JHI
  • Specified min perl version 5.6.0
  • Tweaked COPYRIGHT and LICENSE in pod to match usual form
  • Added "use warnings", but that results in loads of warnings about functions redefined. So added "no warnings 'redefine';". Have to come back and work that one out!
  • Set all VERSION's to 0.96_01. I suspect a switch to Dist::Zilla might be coming soon...
  • Updated README to acknowledge change in maintainer
  • Reformatted as per CPAN::Changes::Spec

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