++ed by:
MIXAS GORTAN CONTRA POTATOGIM RRWO
11 non-PAUSE users
Author image Ed J
and 1 contributors

Changes for version 0.9714 - 2020-12-25

  • remove "omni*" - hypergraphs are simply directed or undirected
  • as_hashes works with undirected hypergraphs
  • add_edge with != 2 vertices only for undirected hypergraph
  • any_edge
  • delete_*_attributes_by_id (and deleting last attribute) now don't destroy that entity
  • AdjacencyMap::Light can have attributes, so no slowdown if use (eg APSP)

Modules

graph data structures and algorithms
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/Light.pm
in lib/Graph/Attribute.pm
in lib/Graph/MSTHeapElem.pm
in lib/Graph/SPTHeapElem.pm