Graph::Undirected - undirected graphs River stage three • 75 direct dependents • 124 total dependents

Graph::Undirected allows you to create undirected graphs. For the available methods, see Graph....

JHI/Graph-0.9704 - 07 Oct 2015 12:34:03 UTC

Boost::Graph::Undirected - Undirected Graph algorithms for Boost::Graph River stage zero No dependents

Perl wrapper for XS code EXPORT None by default....

DBURDICK/Boost-Graph-1.4 - 11 Jul 2007 18:07:27 UTC

Graph::Undirected::Components - Computes components of an undirected graph. River stage zero No dependents

"Graph::Undirected::Components" computes the components of an undirected graph using a disjoint set data structure, so the memory used is bounded by the number of vertices only....

KUBINA/Graph-Undirected-Components-0.31 - 28 Apr 2012 12:38:37 UTC

Graph::Undirected::Components::External - Computes components of an undirected graph. River stage zero No dependents

"Graph::Undirected::Components::External" computes the components of an undirected graph limited only by the amount of free disk space. All errors, warnings, and informational messages are logged using Log::Log4perl....

KUBINA/Graph-Undirected-Components-0.31 - 28 Apr 2012 12:38:37 UTC

Graph::Nauty - Perl bindings for nauty River stage zero No dependents

Graph::Nauty provides an interface to nauty, a set of procedures for determining the automorphism group of a vertex-coloured graph, and for testing graphs for isomorphism. Currently Graph::Nauty only supports Graph::Undirected, that is, it does not h...

MERKYS/Graph-Nauty-0.3.3 - 16 Sep 2020 12:30:53 UTC

Graph::Directed - directed graphs River stage three • 75 direct dependents • 124 total dependents

Graph::Directed allows you to create directed graphs. For the available methods, see Graph....

JHI/Graph-0.9704 - 07 Oct 2015 12:34:03 UTC

Graph::Easy - Convert or render graphs (as ASCII, HTML, SVG or via Graphviz) River stage two • 24 direct dependents • 31 total dependents

"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...

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

Boost::Graph - Perl interface to the Boost-Graph C++ libraries. River stage zero No dependents

Boost::Graph is a perl interface to the Boost-Graph C++ libraries that offer many efficient and peer reviewed algorithms....

DBURDICK/Boost-Graph-1.4 - 11 Jul 2007 18:07:27 UTC

Graph::XGMML - Simple Graph.pm-like interface for generating XGMML graphs River stage zero No dependents

To produce useful diagrams on extremely large graphs, sometimes it is necesary to move beyond simple graphing tools to applications specifically designed for rendering very large graphs, many of which were designed for biology applications (such as m...

ADAMK/Graph-XGMML-0.01 - 10 Aug 2009 12:22:31 UTC

Graph::Convert - Convert between graph formats: Graph and Graph::Easy River stage one • 1 direct dependent • 1 total dependent

"Graph::Convert" lets you convert graphs between the graph formats from Graph and Graph::Easy. It takes a graph object in either format, and converts it to the desired output format. It handles simple graphs (directed or undirected) as well as multi-...

TELS/Graph-Convert-0.09 - 19 Nov 2007 17:50:37 UTC

Graph::Graph6 - read and write graph6, sparse6, digraph6 format graphs River stage one • 1 direct dependent • 1 total dependent

This module reads and writes graph6, sparse6 and digraph6 files. These file formats are per <http://cs.anu.edu.au/~bdm/data/formats.txt> These formats represent a graph (a graph theory graph) with vertices numbered 0 to n-1 encoded into printable ASC...

KRYDE/Graph-Graph6-8 - 12 Jul 2020 00:19:22 UTC

Graph::Simple - simple and intuitive interface for manipulating graph River stage zero No dependents

In computer science, a graph is an abstract data type that is meant to implement the graph and hypergraph concepts from mathematics. A graph data structure consists of a finite (and possibly mutable) set of ordered pairs, called *edges*, of certain e...

SUKRIA/Graph-Simple-0.04 - 14 Sep 2013 09:42:17 UTC

Graph::Matching - Maximum Matching in Graphs River stage zero No dependents

JORISVR/Graph-Matching-0.02 - 30 Apr 2012 10:47:07 UTC

Graph::Dijkstra - Dijkstra computations with methods to input/output graph datasets from/to supported file formats River stage zero No dependents

Efficient implementation of Dijkstras shortest path algorithm in Perl using a Minimum Priority Queue (Array::Heap::ModifiablePriorityQueue**). Computation methods. farthestNode() Shortest path to farthest node from an origin node shortestPath() Short...

DDALLEN/Graph-Dijkstra-0.70 - 14 Mar 2016 13:13:05 UTC

Graph::Bipartite - Graph algorithms on bipartite graphs. River stage zero No dependents

This algorithm computes the maximum matching of a bipartite unweighted and undirected graph in worst case running time O( sqrt(|V|) * |E| ). The constructor takes as first argument the number of vertices of the first partition V1, as second argument ...

DETZOLD/Graph-Bipartite-0.01 - 25 May 2003 21:25:37 UTC

Graph::UnionFind - union-find data structures River stage three • 75 direct dependents • 124 total dependents

*Union-find* is a special data structure that can be used to track the partitioning of a set into subsets (a problem known also as *disjoint sets*). Graph::UnionFind() is used for Graph::connected_components(), Graph::connected_component(), and Graph...

JHI/Graph-0.9704 - 07 Oct 2015 12:34:03 UTC

Graph::Similarity - Calculate similarity of the vertices in graph(s) River stage zero No dependents

Graph is composed of vertices and edges (This is often also referred as nodes/edge in network). Graph::Similarity calculate the similarity of the vertices(nodes) by the following algorithms, SimRank Jeh et al "SimRank: A Measure of Structural-Context...

SHOHEIK/Graph-Similarity-v0.0.5 - 16 Aug 2012 22:42:11 UTC

Graph::NewmanGirvan - Newman-Girvan Graph node clustering River stage zero No dependents

The "newman_girvan" sub takes a Graph object and computes clusters for each vertex in the graph. The implementation is a quick and dirty port of the code in Andreas Noack's linloglayout utility, tested only with graphs with edges with edge weights gr...

BJOERN/Graph-NewmanGirvan-0.3 - 05 Dec 2011 22:26:05 UTC

Graph::Easy::Edge - An edge (a path connecting one ore more nodes) River stage two • 24 direct dependents • 31 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 UTC

Graph::Maker::Star - Creates a star graph. River stage one • 1 direct dependent • 1 total dependent

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

80 results (0.032 seconds)