1.1 --- a/lemon/cycle_canceling.h	Sun Mar 02 22:55:27 2008 +0000
     1.2 +++ b/lemon/cycle_canceling.h	Fri Mar 07 00:24:23 2008 +0000
     1.3 @@ -122,10 +122,10 @@
     1.4  
     1.5      // The maximum number of iterations for the first execution of the
     1.6      // Bellman-Ford algorithm. It should be at least 2.
     1.7 -    static const int BF_FIRST_LIMIT = 2;
     1.8 +    static const int BF_FIRST_LIMIT  = 2;
     1.9      // The iteration limit for the Bellman-Ford algorithm is multiplied
    1.10 -    // by BF_ALPHA in every round.
    1.11 -    static const double BF_ALPHA = 1.5;
    1.12 +    // by BF_LIMIT_FACTOR/100 in every round.
    1.13 +    static const int BF_LIMIT_FACTOR = 150;
    1.14  
    1.15    private:
    1.16  
    1.17 @@ -501,7 +501,7 @@
    1.18            }
    1.19  
    1.20            if (!cycle_found)
    1.21 -            length_bound = int(length_bound * BF_ALPHA);
    1.22 +            length_bound = length_bound * BF_LIMIT_FACTOR / 100;
    1.23          }
    1.24        }
    1.25      }