1.1 --- a/src/work/athos/minlengthpaths.h	Mon May 03 11:43:27 2004 +0000
     1.2 +++ b/src/work/athos/minlengthpaths.h	Mon May 03 14:42:40 2004 +0000
     1.3 @@ -22,7 +22,7 @@
     1.4    /// of minimal total length 
     1.5    ///
     1.6    /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
     1.7 -  /// an algorithm which finds k edge-disjoint paths
     1.8 +  /// an algorithm for finding k edge-disjoint paths
     1.9    /// from a given source node to a given target node in an
    1.10    /// edge-weighted directed graph having minimal total weigth (length).
    1.11    ///