python-graph A library for working with graphs in Python -------------------------------------------------------------------------------- AUTHORS AND CONTRIBUTORS Pedro Matiello * 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 * Mutual Accessibility (Tarjan's Algorithm). Christian Muise * Dot file reading/writing; * Hypergraph class; * Refactoring. Johannes Reinhardt * Refactoring. Nathan Davis * Faster node insertion. Paul Harrison * Mutual Accessibility (Tarjan's Algorithm). Rhys Ulerich * Dijkstra's Shortest path algorithm. Roy Smith * Heuristic Searching (A* algorithm). Salim Fadhley * Porting of Roy Smith's A* implementation to python-graph; * Edmond Chow's heuristic for A*; * Refactoring. Tomaz Kovacic * Transitive edge detection; * Critical path algorithm. Zsolt Haraszti * 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