COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
04/07/04 19:42:05 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@432
Message:

minlengthpaths is ready, but the paths are not yet determined: needs to canonize a flow

File:
1 edited

Legend:

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

    r310 r314  
    6565    const LengthMap& length;
    6666
    67     //auxiliary variable
    68     //The value is 1 iff the edge is reversed
     67    //auxiliry variable
     68    //The value is 1 iff the edge is reversed.
     69    //If the algorithm has finished, the edges of the seeked paths are
     70    //exactly those that are reversed
    6971    EdgeIntMap reversed;
    70 
    7172   
    7273  public :
     
    8485      ConstMap const1map(1);
    8586
     87      //We need a residual graph, in which some of the edges are reversed
    8688      ResGraphType res_graph(G, reversed, const1map);
    8789
     
    9597        dijkstra.run(s);
    9698        if (!dijkstra.reached(t)){
    97           //There is no k path from s to t
    98           /// \TODO mit keresett itt ez a ++?
     99          //There are no k paths from s to t
    99100          return i;
    100101        };
Note: See TracChangeset for help on using the changeset viewer.