[Lemon-commits] [lemon_svn] alpar: r447 - hugo/trunk/src/work/athos

[Lemon SVN]

Author: alpar
Date: Thu Apr 15 10:06:43 2004
New Revision: 447

Modified:
   hugo/trunk/src/work/athos/minlengthpaths.h

Log:
*** empty log message ***

Modified: hugo/trunk/src/work/athos/minlengthpaths.h
==============================================================================
--- hugo/trunk/src/work/athos/minlengthpaths.h	(original)
+++ hugo/trunk/src/work/athos/minlengthpaths.h	Thu Apr 15 10:06:43 2004
@@ -83,9 +83,11 @@
       length(_length), reversed(_G)/*, dijkstra_dist(_G)*/{ }
 
     
-    ///Runs the algorithm
+    ///Runs the algorithm.
+
+    ///Runs the algorithm.
     ///Returns k if there are at least k edge-disjoint paths from s to t.
-    ///Otherwise it returns the number of edge-disjoint paths from s to t.
+    ///Otherwise it returns the number of found edge-disjoint paths from s to t.
     int run(Node s, Node t, int k) {
       ConstMap const1map(1);