diff -r 06495c0e12f5 -r aea952a1af99 lemon/cycle_canceling.h
--- a/lemon/cycle_canceling.h	Tue Dec 04 18:51:35 2007 +0000
+++ b/lemon/cycle_canceling.h	Wed Dec 05 01:43:02 2007 +0000
@@ -86,12 +86,12 @@
   ///
   /// \author Peter Kovacs
 
-template < typename Graph,
-	   typename LowerMap = typename Graph::template EdgeMap<int>,
-	   typename CapacityMap = LowerMap,
-	   typename CostMap = typename Graph::template EdgeMap<int>,
-	   typename SupplyMap = typename Graph::template NodeMap
-				<typename CapacityMap::Value> >
+  template < typename Graph,
+             typename LowerMap = typename Graph::template EdgeMap<int>,
+             typename CapacityMap = LowerMap,
+             typename CostMap = typename Graph::template EdgeMap<int>,
+             typename SupplyMap = typename Graph::template NodeMap
+                                  <typename CapacityMap::Value> >
   class CycleCanceling
   {
     typedef typename Graph::Node Node;
@@ -323,12 +323,12 @@
       if (sum != 0) return false;
 
       // Finding a feasible flow
-      Circulation< Graph, Capacity, ConstMap<Edge, Capacity>,
-	CapacityRefMap, SupplyMap >::DefFlowMap<FlowMap>::Create
-	circulation( graph, constMap<Edge>((Capacity)0),
-		     capacity, supply);
-      circulation.flowMap(flowMap);
-      return circulation.run();
+      Circulation< Graph, ConstMap<Edge, Capacity>, CapacityRefMap,
+		   SupplyMap >
+	circulation( graph, constMap<Edge>((Capacity)0), capacity, 
+		     supply );
+      circulation.flowMap(flow);
+      return circulation.run() == -1;
     }
 
 #ifdef LIMITED_CYCLE_CANCELING