python-graph

A library for working with graphs in Python

This software provides a suitable data structure for representing graphs and a whole set of important algorithms.

INSTALLING

To install the core module, run:

make install-core

To install the dot language support, run:

make install-dot

Alternatively, if you don't have make, you can install the modules by running:

./setup.py install

inside the module directory.

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:

https://github.com/Shoobx/python-graph

Please report bugs at:

https://github.com/Shoobx/python-graph/issues

PROJECT COMMITTERS

Pedro Matiello <[email protected]>

• Original author;
• 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.

Christian Muise <[email protected]>

• Dot file reading/writing;
• Hypergraph class;
• Refactoring.

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;
• Bellman-Ford algorithm;
• Logo design.

CONTRIBUTORS

Eugen Zagorodniy <[email protected]>

• Mutual Accessibility (Tarjan's Algorithm).

Johannes Reinhardt <[email protected]>

• Maximum-flow algorithm;
• Gomory-Hu cut-tree algorithm;
• Refactoring.

Juarez Bochi <[email protected]>

• Pagerank algorithm.

Nathan Davis <[email protected]>

• Faster node insertion.

Paul Harrison <[email protected]>

• Mutual Accessibility (Tarjan's Algorithm).

Peter Sagerson <[email protected]>

• Performance improvements on shortest path algorithm.

Rhys Ulerich <[email protected]>

• Dijkstra's Shortest path algorithm.

Roy Smith <[email protected]>

• Heuristic Searching (A* algorithm).

Zsolt Haraszti <[email protected]>

• Weighted random generated graphs.

Anand Jeyahar <[email protected]>

• Edge deletion on hypergraphs (bug fix).

Emanuele Zattin <[email protected]>

• Hyperedge relinking (bug fix).

Jonathan Sternberg <[email protected]>

• Graph comparison (bug fix);
• Proper isolation of attribute lists (bug fix).

Daniel Merritt <[email protected]>

• Fixed reading of XML-stored graphs with edge attributes.

Sandro Tosi <[email protected]>

• Some improvements to Makefile

LICENSE

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