Changeset 513:60afd11e6cb3 in lemon-0.x for src/work/athos/minlengthpaths.h

Timestamp:

05/03/04 16:42:40 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

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

Message:

xy_test added: it was not entirely useless, I found a mistake in xy.h

File:

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

src/work/athos/minlengthpaths.h

@@ -23 +23 @@
   ///
   /// 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).