COIN-OR::LEMON - Graph Library

Changeset 329:0dade87d013b in lemon-0.x for src


Ignore:
Timestamp:
04/15/04 10:06:43 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@447
Message:

* empty log message *

File:
1 edited

Legend:

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

    r328 r329  
    8484
    8585   
    86     ///Runs the algorithm
     86    ///Runs the algorithm.
     87
     88    ///Runs the algorithm.
    8789    ///Returns k if there are at least k edge-disjoint paths from s to t.
    88     ///Otherwise it returns the number of edge-disjoint paths from s to t.
     90    ///Otherwise it returns the number of found edge-disjoint paths from s to t.
    8991    int run(Node s, Node t, int k) {
    9092      ConstMap const1map(1);
Note: See TracChangeset for help on using the changeset viewer.