Changes for version 0.9705 - 2020-10-20
- document clustering_coefficient return empty list on no vertices - RT#114094
- apply lazy-load patch from Stephen Loyd - RT#123236
- depend on Heap 0.80 instead of local fork. Heap::Elem is really an interface not superclass.
- fix uninitialised value warning in SP_Dijkstra - RT#118539
- fix complement losing vertices on unconnected graphs - RT#115366
- fix average_path_length when two vertices given - RT#120611
- switch to GitHub issues rather than RT
- fix all_successors with non-truthy names - fix #5
- add Graph::Matrix->stringify to help debug
- fix APSP_Floyd_Warshall logic error when subpaths totalled 0 - fix #3
- typo fix - thanks @jkeenan (#6)
- Added "use strict; use warnings;", etc - thanks @manwar (closes #2)
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
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