COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/03/04 16:42:40 (16 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/minlengthpaths.h

    r511 r513  
    2323  ///
    2424  /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
    25   /// an algorithm which finds k edge-disjoint paths
     25  /// an algorithm for finding k edge-disjoint paths
    2626  /// from a given source node to a given target node in an
    2727  /// edge-weighted directed graph having minimal total weigth (length).
Note: See TracChangeset for help on using the changeset viewer.