![]() |
| |||||||
| 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::Bipartite
Graph algorithms on bipartite graphs. |
Graph::BitMatrix
create and manipulate a V x V bit matrix of graph G |
Graph::Centrality::Pagerank
|
| Graph::ChainBuilder
build directed 2-regular cyclic graphs |
Graph::Chart
|
Graph::ChuLiuEdmonds
Find minimum spanning trees in a directed graph. |
| Graph::Clique
Generation of k-cliques in a graph |
Graph::Convert
Convert between graph formats: Graph and Graph::Easy |
Graph::Dependency
Generate dependency graphs and reports |
| Graph::Directed
directed graphs |
Graph::Easy
Convert or render graphs (as ASCII, HTML, SVG or via Graphviz) |
Graph::Easy::As_ascii
Generate ASCII art |
| Graph::Easy::As_graphml
Generate a GraphML text from a Graph::Easy object |
Graph::Easy::As_graphviz
Generate graphviz description from graph object |
Graph::Easy::As_svg
Output a Graph::Easy as Scalable Vector Graphics (SVG) |
| Graph::Easy::As_txt
Generate textual description from graph object |
Graph::Easy::As_vcg
Generate VCG/GDL text from Graph::Easy object |
Graph::Easy::Attributes
Define and check attributes for Graph::Easy |
| Graph::Easy::Base
base class for Graph::Easy objects like nodes, edges etc |
Graph::Easy::Edge
An edge (a path connecting one ore more nodes) |
Graph::Easy::Edge::Cell
A cell in an edge in Graph::Easy |
| Graph::Easy::Group
A group of nodes (aka subgraph) in Graph::Easy |
Graph::Easy::Group::Anon
An anonymous group of nodes in Graph::Easy |
Graph::Easy::Group::Cell
A cell in a group |
| Graph::Easy::Layout
Layout the graph from Graph::Easy |
Graph::Easy::Layout::Chain
Chain of nodes for layouter |
Graph::Easy::Layout::Force
Force-based layouter for Graph::Easy |
| Graph::Easy::Layout::Grid
Grid management and size calculation |
Graph::Easy::Layout::Path
Path management for Manhattan-style grids |
Graph::Easy::Layout::Repair
Repair spliced layout with group cells |
| Graph::Easy::Layout::Scout
Find paths in a Manhattan-style grid |
Graph::Easy::Manual
HTML manual for Graph::Easy |
Graph::Easy::Marpa
|
| Graph::Easy::Marpa::Lexer
|
Graph::Easy::Marpa::Lexer::DFA
|
Graph::Easy::Marpa::Parser
|
| Graph::Easy::Marpa::Renderer::GraphViz2
|
Graph::Easy::Marpa::Utils
|
Graph::Easy::Node
Represents a node in a Graph::Easy graph |
| Graph::Easy::Node::Anon
An anonymous, invisible node in Graph::Easy |
Graph::Easy::Node::Cell
An empty filler cell |
Graph::Easy::Node::Empty
An empty, borderless cell in a node cluster |
| Graph::Easy::Parser
Parse Graph::Easy from textual description |
Graph::Easy::Parser::Graphviz
Parse Graphviz text into Graph::Easy |
Graph::Easy::Parser::VCG
Parse VCG or GDL text into Graph::Easy |
| Graph::Easy::StateMachine
create a FSA framework from a Graph::Easy graph |
Graph::Fast
graph data structures and algorithms, just faster. |
Graph::Fast::GraphPM
Graph.pm compatibility routines for Graph::Fast |
| Graph::Fast_LPQ::GraphPM
|
Graph::Flowchart
Generate easily flowcharts as Graph::Easy objects |
Graph::Flowchart::Node
A node in a Graph::Flowchart, representing a block/expression |
| Graph::Implicit
graph algorithms for implicitly specified graphs |
Graph::Kruskal
Kruskal Algorithm for Minimal Spanning Trees |
Graph::Layout::Aesthetic
Aesthetic Graph Layout |
| Graph::Layout::Aesthetic::Force
Base class for graph layout aesthetic forces |
Graph::Layout::Aesthetic::Force::Centripetal
Nodes try to move away from the center of gravity |
Graph::Layout::Aesthetic::Force::MinEdgeIntersect
Try to make edges uncross |
| Graph::Layout::Aesthetic::Force::MinEdgeIntersect2
Try to make edges uncross, stronger version |
Graph::Layout::Aesthetic::Force::MinEdgeLength
Connected nodes attract |
Graph::Layout::Aesthetic::Force::MinLevelVariance
Try to put nodes at the same level equally far from the left |
| Graph::Layout::Aesthetic::Force::NodeEdgeRepulsion
Nodes and edges repel each other |
Graph::Layout::Aesthetic::Force::NodeRepulsion
Nodes repel each other |
Graph::Layout::Aesthetic::Force::ParentLeft
Try to place parents to the left of their children |
| Graph::Layout::Aesthetic::Force::Perl
Write aesthetic forces using perl |
Graph::Layout::Aesthetic::Include
Include files that were used to build Graph::Layout::Aesthetic |
Graph::Layout::Aesthetic::Monitor::GnuPlot
Display progress of a graph layout using gnuplot |
| Graph::Layout::Aesthetic::Topology
Graph topology for use by Graph::Layout::Aesthetic |
Graph::Layouter
lay out graph onto an abstract plane |
Graph::Layouter::Spring
spring graph drawing algorithm implementation |
| Graph::Maker
Create many types of graphs |
Graph::Maker::BalancedTree
Creates a balanced tree with specified fan out and height |
Graph::Maker::Barbell
Create barbell graphs |
| Graph::Maker::Bipartite
Creates a bipartite graph with a given distribution. |
Graph::Maker::CircularLadder
Create a circular ladder |
Graph::Maker::Complete
Create complete (fully-connected) graphs |
| Graph::Maker::CompleteBipartite
Creates a complete bipartite graph. |
Graph::Maker::Cycle
Create a graph consisting of a cycle. |
Graph::Maker::Degree
Creates a graph from a degree distribution. |
| Graph::Maker::Disconnected
Create a graph with no edges |
Graph::Maker::Disk
Creates a graph with nodes positioned in concentric connected rings. |
Graph::Maker::Empty
Creates an graph with no nodes or edges |
| Graph::Maker::Grid
Creates a graph in a d-dimensional grid. |
Graph::Maker::Hypercube
Create the N-dimensional hypercube graph |
Graph::Maker::Ladder
Creates a ladder graph. |
| Graph::Maker::Linear
Create a linear graph. |
Graph::Maker::Lollipop
Creates a lollipop graph. |
Graph::Maker::Random
Creates a random graph (using Erdos Renyi or with a specified number of edges) |
| Graph::Maker::Regular
Creates a k-regular graph. |
Graph::Maker::SmallWorldBA
Creates a small world graph according to the Barabási-Albert preferential attachment model. |
Graph::Maker::SmallWorldHK
Creates a small world graph according to Holmea, Beom & Kim |
| Graph::Maker::SmallWorldK
Creates a small world graph using Kleinberg's model in 2-dimensions |
Graph::Maker::SmallWorldWS
Creates a small-world graph according to (Newman) Watt and Strogatz |
Graph::Maker::Star
Creates a star graph. |
| Graph::Maker::Uniform
Creates a graph distributed randomly over the d-dimensional grid. |
Graph::Maker::Utils
Small routines that Graph::Maker::* uses. |
Graph::Maker::Wheel
Creates a wheel graph. |
| Graph::Matrix
create and manipulate a V x V matrix of graph G |
Graph::MaxFlow
compute maximum flow between 2 vertices in a graph |
Graph::ModularDecomposition
Modular decomposition of directed graphs |
| Graph::MSTHeapElem
|
Graph::PetriNet
Perl extension for Petri Nets |
Graph::Reader
Base class for graph file format reader |
| Graph::Reader::Dot
class for reading a Graph instance from Dot format |
Graph::Reader::HTK
read an HTK lattice in as an instance of Graph |
Graph::Reader::LoadClassHierarchy
load Graphs from class hierarchies |
| Graph::Reader::XML
Read a Graph from simple XML format |
Graph::Regexp
Create graphical flowchart from a regular expression |
Graph::Renderer
draw the graph onto a real plane |
| Graph::Renderer::Imager
graph rendering interface for Imager |
Graph::SocialMap
Easy tool to create social network map |
Graph::SPTHeapElem
|
| Graph::Statistics
Perl extension for calculating network constraint and other network statistics. |
Graph::Template
Graph::Template |
Graph::Template::Base
|
| Graph::Template::Constants
|
Graph::Template::Container
|
Graph::Template::Container::Data
|
| Graph::Template::Container::Graph
Graph::Template::Container::Graph |
Graph::Template::Container::Scope
|
Graph::Template::Context
|
| Graph::Template::Element
|
Graph::Template::Element::DataPoint
|
Graph::Template::Element::Title
|
| Graph::Template::Element::Var
|
Graph::Template::Element::XLabel
|
Graph::Template::Element::YLabel
|
| Graph::Template::Factory
|
Graph::Template::Iterator
|
Graph::Template::TextObject
|
| Graph::Timeline
Render timeline data |
Graph::Timeline::DiagonalGD
Render timeline data with GD |
Graph::Timeline::GD
Render timeline data with GD |
| Graph::TransitiveClosure
create and query transitive closure of graph |
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 |
Graph::Usage
graph usage patterns from Perl packages |
Graph::Writer
Base class for graph file format writer |
| Graph::Writer::daVinci
Write a Graph in file format used by daVinci |
Graph::Writer::Dot
Write a Graph in file format used by Dot |
Graph::Writer::DrGeo
Save the graph output DrGeo scheme script. |
| Graph::Writer::GraphViz
GraphViz Writer for Graph object |
Graph::Writer::HTK
write a perl Graph out as an HTK lattice file |
Graph::Writer::TGXML
write out directed graph as TouchGraph LinkBrowser XML |
| Graph::Writer::VCG
Write a Graph in file format used by VCG |
Graph::Writer::XML
Write a Graph in a simple XML format |
Graph::XGMML
Simple Graph.pm-like interface for generating XGMML graphs |
| Problems, suggestions, or comments to Randy Kobes. | Questions? Check the FAQ. | |
| Enable installations using PAR::WebStart. |