1.1 --- a/lemon/min_cost_flow.h	Fri Nov 04 13:53:22 2005 +0000
     1.2 +++ b/lemon/min_cost_flow.h	Fri Nov 04 14:48:10 2005 +0000
     1.3 @@ -151,7 +151,7 @@
     1.4  	Node n=t;
     1.5  	ResGraphEdge e;
     1.6  	while (n!=s){
     1.7 -	  e = dijkstra.pred(n);
     1.8 +	  e = dijkstra.predEdge(n);
     1.9  	  n = dijkstra.predNode(n);
    1.10  	  res_graph.augment(e,1);
    1.11  	  //Let's update the total length