# HG changeset patch
# User alpar
# Date 1082016403 0
# Node ID 0dade87d013ba832e154d0a089eefd20a46a7202
# Parent  e2dd93586ebf097769823974d33f5e0e99e83c2d
*** empty log message ***

diff -r e2dd93586ebf -r 0dade87d013b src/work/athos/minlengthpaths.h
--- a/src/work/athos/minlengthpaths.h	Thu Apr 15 08:00:17 2004 +0000
+++ b/src/work/athos/minlengthpaths.h	Thu Apr 15 08:06:43 2004 +0000
@@ -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);