Changeset 634:aacabcd724f0 in lemon0.x
 Timestamp:
 05/13/04 19:33:40 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@825
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/hugo/mincostflows.h
r633 r634 119 119 flow.set(e,0); 120 120 } 121 121 122 //Initialize the potential to zero 122 123 FOR_EACH_LOC(typename Graph::NodeIt, n, G){ 123 //cout << potential[n]<<endl;124 124 potential.set(n,0); 125 125 } … … 129 129 //We need a residual graph 130 130 ResGraphType res_graph(G, capacity, flow); 131 132 //Initialize the copy of the Dijkstra potential to zero133 134 //typename ResGraphType::template NodeMap<Length> potential(res_graph);135 131 136 132 … … 147 143 }; 148 144 149 //We have to c opythe potential145 //We have to change the potential 150 146 FOR_EACH_LOC(typename ResGraphType::NodeIt, n, res_graph){ 151 147 potential[n] += dijkstra.distMap()[n]; 152 148 } 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 162 150 163 151 //Augmenting on the sortest path
Note: See TracChangeset
for help on using the changeset viewer.