This module is a backend to the perl compiler (B::*) which, instead of outputting bytecode or C based on perl's compiled version of a program, writes descriptions in graph-description languages specifying graphs that show the program's structure. It ...

A graphical Chartmaker at Canvas (Realtime). This is a real Canvas widget, so you can draw with the standard routines in the Canvas object. For example, you can draw a line with *$chart*->*line(x,y,...)*. This is useful for you when you will add a lo...

Obviously a topic map is also a graph, the topics being the nodes, and the associations forming the edges, albeit these connections connect not always only two nodes, but, ok, you should know TMs by now. This package provides some functions which foc...

GD::Graph is a *perl5* module to create charts using the GD module. The following classes for graphs with axes are defined: "GD::Graph::lines" Create a line chart. "GD::Graph::bars" and "GD::Graph::hbars" Create a bar chart with vertical or horizonta...

Graph::D3 is a moudle to covert Graph object to the format which is used in d3.js(http://d3js.org/). This module simply supports node-edge graph in the example....

*GenerateTreeGraphFile* generates a graphical representation of the dependency try just before a build starts. EXPORT None....

The Graph Modelling Language (see http://en.wikipedia.org/wiki/Graph_Modelling_Language> ) is an ASCII file format for describing graphs. It is quite extensive, not only defining the graph itself but including tags for graphics. This perl module is c...

SVG::Graph is a suite of perl modules for plotting data. SVG::Graph currently supports plots of one-, two- and three-dimensional data, as well as N-ary rooted trees. Data may be represented as: Glyph Name Dimensionality supported 1d 2d 3d tree ------...

This module creates CGI graphs which allow the user to visualize spreadsheet data using scatter plots, bar plots, histograms, etc. It provides features for easy interactions such as panning, zooming, element selection, and axis selection. An input fi...

Base graph object that defines the graph interface....

A collection of inter-related GOBO::Node objects. With a simple ontology these are typically GOBO::TermNode objects, although other graphs e.g. instance graphs are possible. This module deliberately omits any kind of graph traversal functionality. Th...

Some data is easier to analyze graphically than in its raw form. In many cases, however, a full-blown multicolor graphic representation is overkill. In these cases, a simple graph can provide an appropriate graphical representation. The Text::Graph m...

Graph::Fast implements a mathematical abstract data structure, called graph, that models relations between objects with vertices and edges. Graph::Fast vs Graph While Graph is a module with a lot of features, it is not really fast. Graph::Fast doesn'...

OGDL is a human editable alternative to XML. It embeds information in the form of graphs, where the nodes are strings and the arcs or edges are spaces or indentations. This class facilitates the manipulation of ogdl graph....

"Graph::Easy" lets you generate graphs consisting of various shaped nodes connected by edges (with optional labels). It can read and write graphs in a variety of formats, as well as render them via its own grid-based layouter. Since the layouter work...

This module parses mailbox files in either compressed or uncompressed form and then generates pretty statistics and graphs about them. Although at first developed to do spam statistics, it works just fine for normal mail. File Format The module reads...

PRANG::Graph allows you to mark attributes on your Moose classes as corresponding to XML attributes and child elements. This allows your class structure to function as an *XML graph* (a generalized form of an specification for the shape of an XML doc...

This package provides an object class which can be used to get diferents graph paths , with only pure perl code and I don't use other packet or module cpan. This class calculates the shortest path between two nodes in a graph and return in other meth...