diff -r f1fb0c31f952 -r 8eed667ea23c lemon/cycle_canceling.h
--- a/lemon/cycle_canceling.h	Sun Mar 02 22:55:27 2008 +0000
+++ b/lemon/cycle_canceling.h	Fri Mar 07 00:24:23 2008 +0000
@@ -122,10 +122,10 @@
 
     // The maximum number of iterations for the first execution of the
     // Bellman-Ford algorithm. It should be at least 2.
-    static const int BF_FIRST_LIMIT = 2;
+    static const int BF_FIRST_LIMIT  = 2;
     // The iteration limit for the Bellman-Ford algorithm is multiplied
-    // by BF_ALPHA in every round.
-    static const double BF_ALPHA = 1.5;
+    // by BF_LIMIT_FACTOR/100 in every round.
+    static const int BF_LIMIT_FACTOR = 150;
 
   private:
 
@@ -501,7 +501,7 @@
           }
 
           if (!cycle_found)
-            length_bound = int(length_bound * BF_ALPHA);
+            length_bound = length_bound * BF_LIMIT_FACTOR / 100;
         }
       }
     }