++ed by:
POTATOGIM SYP NNUTTER PAVELSR EGOR

15 PAUSE users
11 non-PAUSE users.

Author image Jarkko Hietaniemi

Modules

graph data structures and algorithms
create and a map of graph vertices or edges
create and a 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
traverse graphs
breadth-first traversal of graphs
depth-first traversal of graphs
undirected graphs
union-find data structures
Perl extension for elements to be put in Heaps
a Perl extension for keeping data partially sorted

Provides

in lib/Graph/AdjacencyMap/Heavy.pm
in lib/Graph/AdjacencyMap/Light.pm
in lib/Graph/Attribute.pm
in lib/Graph/MSTHeapElem.pm
in lib/Graph/SPTHeapElem.pm
in lib/Graph/TransitiveClosure.pm