COIN-OR::LEMON - Graph Library

Changeset 634:aacabcd724f0 in lemon-0.x


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

Another slight modifications.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/mincostflows.h

    r633 r634  
    119119        flow.set(e,0);
    120120      }
    121      
     121
     122      //Initialize the potential to zero
    122123      FOR_EACH_LOC(typename Graph::NodeIt, n, G){
    123         //cout << potential[n]<<endl;
    124124        potential.set(n,0);
    125125      }
     
    129129      //We need a residual graph
    130130      ResGraphType res_graph(G, capacity, flow);
    131 
    132       //Initialize the copy of the Dijkstra potential to zero
    133      
    134       //typename ResGraphType::template NodeMap<Length> potential(res_graph);
    135131
    136132
     
    147143        };
    148144       
    149         //We have to copy the potential
     145        //We have to change the potential
    150146        FOR_EACH_LOC(typename ResGraphType::NodeIt, n, res_graph){
    151147          potential[n] += dijkstra.distMap()[n];
    152148        }
    153         /*
    154         {
    155           //We have to copy the potential
    156           typename ResGraphType::NodeIt n;
    157           for ( res_graph.first(n) ; res_graph.valid(n) ; res_graph.next(n) ) {
    158               potential[n] += dijkstra.distMap()[n];
    159           }
    160         }
    161         */
     149
    162150
    163151        //Augmenting on the sortest path
Note: See TracChangeset for help on using the changeset viewer.