1.1 --- a/lemon/capacity_scaling.h	Fri Feb 29 15:57:52 2008 +0000
     1.2 +++ b/lemon/capacity_scaling.h	Fri Feb 29 16:09:29 2008 +0000
     1.3 @@ -656,7 +656,7 @@
     1.4        {
     1.5          // Running Dijkstra
     1.6          s = _excess_nodes[next_node];
     1.7 -        if ((t = _dijkstra->run(s)) == INVALID) break;
     1.8 +        if ((t = _dijkstra->run(s)) == INVALID) return false;
     1.9  
    1.10          // Augmenting along a shortest path from s to t
    1.11          Capacity d = std::min(_excess[s], -_excess[t]);