diff -r d5fe2f3f95fc -r 60afd11e6cb3 src/work/athos/minlengthpaths.h
--- a/src/work/athos/minlengthpaths.h	Mon May 03 11:43:27 2004 +0000
+++ b/src/work/athos/minlengthpaths.h	Mon May 03 14:42:40 2004 +0000
@@ -22,7 +22,7 @@
   /// of minimal total length 
   ///
   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
-  /// an algorithm which finds k edge-disjoint paths
+  /// an algorithm for finding k edge-disjoint paths
   /// from a given source node to a given target node in an
   /// edge-weighted directed graph having minimal total weigth (length).
   ///