diff -r 4d3bc1d04c1d -r 1bbb28acb8c9 lemon/capacity_scaling.h
--- a/lemon/capacity_scaling.h	Fri Feb 29 15:57:52 2008 +0000
+++ b/lemon/capacity_scaling.h	Fri Feb 29 16:09:29 2008 +0000
@@ -656,7 +656,7 @@
       {
         // Running Dijkstra
         s = _excess_nodes[next_node];
-        if ((t = _dijkstra->run(s)) == INVALID) break;
+        if ((t = _dijkstra->run(s)) == INVALID) return false;
 
         // Augmenting along a shortest path from s to t
         Capacity d = std::min(_excess[s], -_excess[t]);