equal
deleted
inserted
replaced
145 return false; |
145 return false; |
146 } else { |
146 } else { |
147 |
147 |
148 //We have to change the potential |
148 //We have to change the potential |
149 for(typename ResGW::NodeIt n(res_graph); n!=INVALID; ++n) |
149 for(typename ResGW::NodeIt n(res_graph); n!=INVALID; ++n) |
150 potential[n] += dijkstra.distMap()[n]; |
150 potential.set(n, potential[n]+dijkstra.distMap()[n]); |
151 |
151 |
152 //Augmenting on the sortest path |
152 //Augmenting on the sortest path |
153 Node n=t; |
153 Node n=t; |
154 ResGraphEdge e; |
154 ResGraphEdge e; |
155 while (n!=s){ |
155 while (n!=s){ |