python-graph

A library for working with graphs in Python

--------------------------------------------------------------------------------

AUTHORS AND CONTRIBUTORS

Pedro Matiello <[email protected]>

* Project maintainer/leader;

* Graph, Digraph and Hipergraph classes;

* Accessibility algorithms;

* Cut-node and cut-edge detection;

* Cycle detection;

* Depth-first and Breadth-first searching;

* Minimal Spanning Tree (Prim's algorithm);

* Random graph generation;

* Topological sorting;

* Traversals;

* XML reading/writing;

* Refactoring.

Eugen Zagorodniy <[email protected]>

* Mutual Accessibility (Tarjan's Algorithm).

Christian Muise <[email protected]>

* Dot file reading/writing;

* Hypergraph class;

* Refactoring.

Johannes Reinhardt <[email protected]>

* Refactoring.

Nathan Davis <[email protected]>

* Faster node insertion.

Paul Harrison <[email protected]>

* Mutual Accessibility (Tarjan's Algorithm).

Rhys Ulerich <[email protected]>

* Dijkstra's Shortest path algorithm.

Roy Smith <[email protected]>

* Heuristic Searching (A* algorithm).

Salim Fadhley <[email protected]>

* Porting of Roy Smith's A* implementation to python-graph;

* Edmond Chow's heuristic for A*;

* Refactoring.

Tomaz Kovacic <[email protected]>

* Transitive edge detection;

* Critical path algorithm.

Zsolt Haraszti <[email protected]>

* Weighted random generated graphs.

LICENSE

This software is provided under the MIT license. See accompanying COPYING file for details.

DOCUMENTATION

To generate the API documentation for this package, run:

make docs

You'll need epydoc installed in your system.

WEBSITE

The latest version of this package can be found at:

http://code.google.com/p/python-graph/

Please report bugs at:

http://code.google.com/p/python-graph/issues/list