Browse and search CPAN : Graph

Distribution	Graph [Download]
Author	JHI [ Jarkko Hietaniemi ]
Version	0.94
Abstract	Data structure and ops for directed graphs
Released	13 Mar 2010
Size	143.5 KB
MD5 Checksum	21c7c5b108fdf898ca1679a0509ccbb2
Additional Files	README \| META \| Changes \| Makefile.PL \|
Links	search.cpan.org \| CPAN::Forum \| AnnoCPAN \| rt.cpan.org \| Rating \| CPANTS \| CPAN testers \| Dependencies \| Testers matrix
Prerequisites	List::Util \| Math::Complex \| Safe \| Scalar::Util \| Storable \| Test::More \|

Modules

Graph [source] [v 0.94]	Data structure and ops for directed graphs
Graph::AdjacencyMap [source]	create and a map of graph vertices or edges
Graph::AdjacencyMap::Heavy [source]
Graph::AdjacencyMap::Light [source]
Graph::AdjacencyMap::Vertex
Graph::AdjacencyMatrix [source]	create and query the adjacency matrix of graph G
Graph::Attribute [source]
Graph::BitMatrix [source]	create and manipulate a V x V bit matrix of graph G
Graph::Directed [source]	directed graphs
Graph::Matrix [source]	create and manipulate a V x V matrix of graph G
Graph::MSTHeapElem [source] [v 0.01]
Graph::SPTHeapElem [source] [v 0.01]
Graph::TransitiveClosure [source]	create and query transitive closure of graph
Graph::TransitiveClosure::Matrix [source]	create and query transitive closure of graph
Graph::Traversal [source]	traverse graphs
Graph::Traversal::BFS [source]	breadth-first traversal of graphs
Graph::Traversal::DFS [source]	depth-first traversal of graphs
Graph::Undirected [source]	undirected graphs
Graph::UnionFind [source]	union-find data structures
Heap071::Elem [v 0.71]
Heap071::Fibonacci [v 0.71]

Development Stage (Note: NO IMPLIED TIMESCALES)	Released
Support Level	Developer
Language Used	Perl-only, no compiler needed, should be platform independent
Interface Style	Object oriented using blessed references and/or inheritance
Public License	not specified