Graph::Easy::Base - base class for Graph::Easy objects like nodes, edges etc River stage two • 24 direct dependents • 28 total dependents

Used automatically and internally by Graph::Easy - should not be used directly....

SHLOMIF/Graph-Easy-0.76 - 06 Jun 2016 07:33:51 GMT

PRANG::Graph::Seq - a sequence of graph nodes River stage one • 2 direct dependents • 2 total dependents

This graph node specifies that the XML graph at this point has a sequence of text nodes, elements, element choices or quantities thereof, depending on the type of entries in the members property. Classes with only one element defined do not have one ...

MUTANT/PRANG-0.20 - 21 May 2017 02:47:36 GMT

Data::Graph::Util - Utilities related to graph data structure River stage one • 3 direct dependents • 4 total dependents

Early release. More functions will be added later. Keywords: topological ordering, dependency sorting, dependency ordering....

PERLANCAR/Data-Graph-Util-0.006 - 14 Feb 2019 17:35:03 GMT

Map::Metro::Graph - An entire graph River stage two • 19 direct dependents • 20 total dependents

This class is at the core of Map::Metro. After a map has been parsed the returned instance of this class contains the entire network (graph) in a hierarchy of objects....

CSSON/Map-Metro-0.2405 - 23 Jul 2016 11:45:41 GMT

Graph::Easy::Edge - An edge (a path connecting one ore more nodes) River stage two • 24 direct dependents • 28 total dependents

A "Graph::Easy::Edge" represents an edge between two (or more) nodes in a simple graph. Each edge has a direction (from source to destination, or back and forth), plus a style (line width and style), colors etc. It can also have a label, e.g. a text ...

SHLOMIF/Graph-Easy-0.76 - 06 Jun 2016 07:33:51 GMT

GD::Graph::colour - Colour manipulation routines for use with GD::Graph River stage two • 32 direct dependents • 36 total dependents

The GD::Graph::colour package provides a few routines to work with colours. The functionality of this package is mainly defined by what is needed, now and historically, by the GD::Graph modules....

RUZ/GDGraph-1.54 - 21 Nov 2016 12:24:54 GMT

RDF::Trine::Graph - Materialized RDF Graphs for testing isomorphism River stage three • 72 direct dependents • 111 total dependents

RDF::Trine::Graph provdes a mechanism for testing graph isomorphism based on graph triples from either a RDF::Trine::Model or a RDF::Trine::Iterator. Isomorphism testing requires materializing all of a graph's triples in memory, and so should be used...

GWILLIAMS/RDF-Trine-1.019 - 05 Jan 2018 05:05:19 GMT

Meta::Pdmt::Graph - data structure that represents a Pdmt graph. River stage zero No dependents

This is the dependency graph object for the Pdmt project. The graph is a graph which represents objects (files, db records or whatever) that need to be maintained up to date one relative to the other. Each node in the graph needs to implement two met...

VELTZER/Meta-0.08 - 31 Dec 2002 10:05:41 GMT

Apache::GD::Graph - Generate Graphs in an Apache handler. River stage zero No dependents

The primary purpose of this module is to allow a very easy to use, lightweight and fast charting capability for static pages, dynamic pages and CGI scripts, with the chart creation process abstracted and placed on any server. For example, embedding a...

RKITOVER/Apache-GDGraph-0.96 - 09 Apr 2003 17:50:50 GMT

Graph::Easy::Node - Represents a node in a Graph::Easy graph River stage two • 24 direct dependents • 28 total dependents

A "Graph::Easy::Node" represents a node in a simple graph. Each node has contents (a text, an image or another graph), and dimension plus an origin. The origin is typically determined by a graph layouter module like Graph::Easy....

SHLOMIF/Graph-Easy-0.76 - 06 Jun 2016 07:33:51 GMT

Graph::Fast::GraphPM - Graph.pm compatibility routines for Graph::Fast River stage zero No dependents

This module exposes a Graph style interface to Graph::Fast, allowing existing applications using Graph::Directed to use Fastgraph without changes....

PENMA/Graph-Fast-0.02 - 29 May 2010 21:01:39 GMT

Graph::ModularDecomposition - Modular decomposition of directed graphs River stage zero No dependents

This module extends Graph::Directed by providing new methods related to modular decomposition. The most important new method is modular_decomposition_EGMS(), which for a directed graph with n vertices finds the modular decomposition tree of the graph...

AZS/Graph-ModularDecomposition-0.15 - 04 Apr 2017 23:16:28 GMT

Graph::Maker::Disk - Creates a graph with nodes positioned in concentric connected rings. River stage one • 1 direct dependent • 1 total dependent

BATZ/Graph-Maker-0.02 - 21 May 2008 22:47:07 GMT

DBIx::Class::Graph River stage zero No dependents

This module allows to create and interact with a directed graph. It will take care of storing the information in a relational database. It uses Graph for calculations. This module extends the DBIx::Class::ResultSet. Some methods are added to the resu...

PERLER/DBIx-Class-Graph-1.05 - 27 Dec 2011 13:27:06 GMT

Scene::Graph::Node - A Node in a scene River stage zero No dependents

GPHAT/Scene-Graph-0.01 - 06 Jan 2010 00:29:41 GMT

App::Widget::Graph - A graph for displaying data using HTML tables for bar graphs River stage one • 1 direct dependent • 1 total dependent

A graph for displaying data using HTML tables for bar graphs....

SPADKINS/App-Widget-0.968 - 09 Jun 2010 21:33:31 GMT

ODO::Graph::Events River stage one • 1 direct dependent • 1 total dependent

EKAWAS/PLUTO-0.30 - 12 May 2011 23:49:49 GMT

Graph::Writer::Dot - write out directed graph in Dot format River stage two • 12 direct dependents • 14 total dependents

Graph::Writer::Dot is a class for writing out a directed graph in the file format used by the *dot* tool (part of the AT+T graphviz package). The graph must be an instance of the Graph class, which is actually a set of classes developed by Jarkko Hie...

NEILB/Graph-ReadWrite-2.09 - 05 Aug 2016 20:24:35 GMT

Graph::Reader::Dot - class for reading a Graph instance from Dot format River stage two • 12 direct dependents • 14 total dependents

Graph::Reader::Dot is a class for reading in a directed graph in the file format used by the *dot* tool (part of the AT+T graphviz package). Graph::Reader::Dot is a subclass of Graph::Reader, which defines the generic interface for Graph reader class...

NEILB/Graph-ReadWrite-2.09 - 05 Aug 2016 20:24:35 GMT

Graph::Reader::TGF - Perl class for reading a graph from TGF format. River stage one • 2 direct dependents • 2 total dependents

SKIM/Graph-Reader-TGF-0.03 - 29 Oct 2015 13:25:13 GMT

567 results (0.026 seconds)