1.1 --- a/src/work/athos/minlengthpaths.h	Thu Apr 15 08:00:17 2004 +0000
     1.2 +++ b/src/work/athos/minlengthpaths.h	Thu Apr 15 08:06:43 2004 +0000
     1.3 @@ -83,9 +83,11 @@
     1.4        length(_length), reversed(_G)/*, dijkstra_dist(_G)*/{ }
     1.5  
     1.6      
     1.7 -    ///Runs the algorithm
     1.8 +    ///Runs the algorithm.
     1.9 +
    1.10 +    ///Runs the algorithm.
    1.11      ///Returns k if there are at least k edge-disjoint paths from s to t.
    1.12 -    ///Otherwise it returns the number of edge-disjoint paths from s to t.
    1.13 +    ///Otherwise it returns the number of found edge-disjoint paths from s to t.
    1.14      int run(Node s, Node t, int k) {
    1.15        ConstMap const1map(1);
    1.16