Changeset 329:0dade87d013b in lemon-0.x for src/work

Timestamp:

04/15/04 10:06:43 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@447

Message:

* empty log message *

File:

• src/work/athos/minlengthpaths.h (modified) (1 diff)

src/work/athos/minlengthpaths.h

@@ -84 +84 @@
 
     
-    ///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);