Changes for version 0.9732 - 2024-09-02

  • delete_vertex_by_id now deletes edges if vertex multiness to 0
  • add filter_{vertic,edg}es
  • {un,}directed_copy no longer use caching mechanism so can mutate copies

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