| This Release | Graph-0.96 | [Download] [Browse] | 25 May 2013 | |||
| Other Releases | ||||||
| Links | [ Discussion Forum ] [ View/Report Bugs ] [ Dependencies ] [ Other Tools ] | |||||
| CPAN Testers | PASS (438) [ View Reports ] [ Perl/Platform Version Matrix ] | |||||
| Rating |
(6 Reviews)
[ Rate this distribution ]
| |||||
| License | The Perl 5 License (Artistic 1 & GPL 1) | |||||
| Special Files |
|
|||||
| Graph | graph data structures and algorithms | 0.96 | |
| Graph::AdjacencyMap | create and a map of graph vertices or edges | ||
| Graph::AdjacencyMap::Heavy | |||
| Graph::AdjacencyMap::Light | |||
| Graph::AdjacencyMap::Vertex | |||
| Graph::AdjacencyMatrix | create and query the adjacency matrix of graph G | ||
| Graph::Attribute | |||
| Graph::BitMatrix | create and manipulate a V x V bit matrix of graph G | ||
| Graph::Directed | directed graphs | ||
| Graph::MSTHeapElem | 0.01 | ||
| Graph::Matrix | create and manipulate a V x V matrix of graph G | ||
| Graph::SPTHeapElem | 0.01 | ||
| Graph::TransitiveClosure | |||
| 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 | 0.71 | ||
| Heap071::Fibonacci | 0.71 |
| Heap::Elem | Perl extension for elements to be put in Heaps |
| Heap::Fibonacci | a Perl extension for keeping data partially sorted |
