Perl module for graph data structures and algorithms
This module contains the Graph module for Perl, a framework for
creating abstract data structures called graphs and hypergraphs.
(It is not for drawing any sort of graphics; for that, see the
GD:: or Graphics:: set of modules.) It also contains implementations
of several well-known algorithms that operate on graphs, such as
finding transitive closures, strongly connected components
(SCCs) and articulation points.
This is Graph, a Perl module for dealing with graphs, the abstract
data structures. (If you were looking for pie charts, I'm sorry.)
This is a full rewrite of the Graph module 0.2xx series as discussed
in the book "Mastering Algorithms with Perl", written by Jarkko
Hietaniemi (the undersigned), John Macdonald, and Jon Orwant,
and published by O'Reilly and Associates. This rewrite is not
Graph(3pm) User Contributed Perl Documentation Graph(3pm)
Graph - graph data structures and algorithms
my $g0 = Graph->new; # A directed graph.
my $g1 = Graph::Directed->new; # A directed graph.
my $g2 =
Graph::AdjacencyMUserpContributed Perl DocumGraph::AdjacencyMap(3pm)
Graph::AdjacencyMap - create and a map of graph vertices or
This module is meant for internal use by the Graph module.
Delete a Map path by ids.
Delete a Ma
Graph::AdjacencyMUserxContributed Perl DoGraph::AdjacencyMatrix(3pm)
Graph::BitMatrix(User Contributed Perl DocumentGraph::BitMatrix(3pm)
Graph::Directed(3User Contributed Perl DocumentaGraph::Directed(3pm)
Graph::Matrix(3pmUser Contributed Perl DocumentatiGraph::Matrix(3pm)
Browse inside libgraph-perl_0.91-1_all.deb