/ 
Graph-0.9709
River stage three • 78 direct dependents • 141 total dependents
27 ++

Changes for version 0.9709 - 2020-11-22

  • add path_count option to TransitiveClosure
  • get_{edge,vertex}_attributes undef if no such entity, in list context
  • as_hashes method
  • ingest method

Modules

Graph
graph data structures and algorithms
Graph::AdjacencyMap
create and a map of graph vertices or edges
Graph::AdjacencyMap::Vertex
create and a 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::Heavy
in lib/Graph/AdjacencyMap/Heavy.pm
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