[Python-modules-commits] r12126 - in packages/python-graph/trunk/debian (changelog control)

[morph at users.alioth.debian.org]

    Date: Wednesday, March 3, 2010 @ 00:02:32
  Author: morph
Revision: 12126

updated long description

Modified:
  packages/python-graph/trunk/debian/changelog
  packages/python-graph/trunk/debian/control

Modified: packages/python-graph/trunk/debian/changelog
===================================================================
--- packages/python-graph/trunk/debian/changelog	2010-03-02 23:59:13 UTC (rev 12125)
+++ packages/python-graph/trunk/debian/changelog	2010-03-03 00:02:32 UTC (rev 12126)
@@ -15,6 +15,7 @@
     - suggests python-pyparsing, needed for dot support
     - fixed Provices/Provides typo
     - drop 'python-graph' transitional package
+    - updated long description
   * debian/copyright
     - extended packaging copyright years, fixing the legal notice too
   * debian/{control, rules}
@@ -22,7 +23,7 @@
   * debian/README.Debian
     - removed, no more needed
 
- -- Sandro Tosi <morph at debian.org>  Wed, 03 Mar 2010 00:58:52 +0100
+ -- Sandro Tosi <morph at debian.org>  Wed, 03 Mar 2010 01:02:02 +0100
 
 python-graph (1.6.1-1) unstable; urgency=low
 

Modified: packages/python-graph/trunk/debian/control
===================================================================
--- packages/python-graph/trunk/debian/control	2010-03-02 23:59:13 UTC (rev 12125)
+++ packages/python-graph/trunk/debian/control	2010-03-03 00:02:32 UTC (rev 12126)
@@ -34,10 +34,14 @@
  .
   * Accessibility (transitive closure)
   * Breadth-first search
+  * Critical path algorithm
   * Cut-vertex and cut-edge identification
+  * Cycle detection
   * Depth-first search
+  * Heuristic search (A* algorithm)
   * Identification of connected components
   * Minimum spanning tree (Prim's algorithm)
   * Mutual-accessibility (strongly connected components)
-  * Shortest path (Dijkstra's algorithm)
-  * Topological sorting 
+  * Shortest path search (Dijkstra's algorithm)
+  * Topological sorting
+  * Transitive edge identification