1.1 --- a/src/lemon/min_cost_flow.h	Wed Dec 01 14:08:37 2004 +0000
     1.2 +++ b/src/lemon/min_cost_flow.h	Thu Dec 02 17:36:07 2004 +0000
     1.3 @@ -147,7 +147,7 @@
     1.4  
     1.5  	//We have to change the potential
     1.6  	for(typename ResGW::NodeIt n(res_graph); n!=INVALID; ++n)
     1.7 -	  potential[n] += dijkstra.distMap()[n];
     1.8 +	  potential.set(n, potential[n]+dijkstra.distMap()[n]);
     1.9  	
    1.10  	//Augmenting on the sortest path
    1.11  	Node n=t;