/ 
Graph-0.9717
River stage three • 83 direct dependents • 147 total dependents

Changes for version 0.9717 - 2021-01-27

  • bulk APIs for UnionFind
  • add unionfind config option for util/grand.pl (benchmark-ish script)
  • GRAPH_ALLOW_RECURSION env var to turn off recursion protection
  • "Light" edge-map now uses bit-vectors -> smaller storage
  • directed hypergraphs
  • fix same_biconnected_components logic when given >2 vertices

Modules

Graph
graph data structures and algorithms
Graph::AdjacencyMap
map of graph vertices or edges
Graph::AdjacencyMatrix
create and query the adjacency matrix of graph G
Graph::BitMatrix
create and manipulate a V x V bit matrix of graph G
Graph::Directed
directed graphs
Graph::Matrix
create and manipulate a V x V matrix of graph G
Graph::TransitiveClosure
create and query transitive closure of graph
Graph::TransitiveClosure::Matrix
create and query transitive closure of graph
Graph::Traversal
traverse graphs
Graph::Traversal::BFS
breadth-first traversal of graphs
Graph::Traversal::DFS
depth-first traversal of graphs
Graph::Undirected
undirected graphs
Graph::UnionFind
union-find data structures

Provides

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

Other files