## 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::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
- Heap071::Elem - Perl extension for elements to be put in Heaps
- Heap071::Fibonacci - a Perl extension for keeping data partially sorted

## 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
- Graph::TransitiveClosure in lib/Graph/TransitiveClosure.pm