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

Changes for version 0.9713 - 2020-12-19

  • fix edges_at on self-edges in scalar context
  • fix refvertexed_stringified predicate
  • remove "hypervertices": a collection of n vertices is a hyperedge
  • AdjacencyMap.get_paths_by_ids
  • transitive_closure et al no longer re-bless objects to Graph
  • AdjacencyMap.get_ids_by_paths
  • no more uniqedged configurability
  • BitMatrix transpose option
  • Transitive closure records path successor, not predecessor. Method name and docs updated.

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::Heavy
in lib/Graph/AdjacencyMap/Heavy.pm
Graph::AdjacencyMap::Light
in lib/Graph/AdjacencyMap/Light.pm
Graph::AdjacencyMap::Vertex
in lib/Graph/AdjacencyMap/Vertex.pm
Graph::Attribute
in lib/Graph/Attribute.pm
Graph::MSTHeapElem
in lib/Graph/MSTHeapElem.pm
Graph::SPTHeapElem
in lib/Graph/SPTHeapElem.pm

Other files