1.1 --- a/lemon/preflow.h	Mon Aug 08 13:02:26 2011 +0200
     1.2 +++ b/lemon/preflow.h	Mon Aug 08 13:13:03 2011 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2011
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -554,10 +554,10 @@
    1.13            (*_excess)[v] += rem;
    1.14          }
    1.15        }
    1.16 -      for (NodeIt n(_graph); n != INVALID; ++n) 
    1.17 +      for (NodeIt n(_graph); n != INVALID; ++n)
    1.18          if(n!=_source && n!=_target && _tolerance.positive((*_excess)[n]))
    1.19            _level->activate(n);
    1.20 -          
    1.21 +
    1.22        return true;
    1.23      }
    1.24  
    1.25 @@ -585,7 +585,7 @@
    1.26            if (n == INVALID) goto first_phase_done;
    1.27            level = _level->highestActiveLevel();
    1.28            --num;
    1.29 -          
    1.30 +
    1.31            Value excess = (*_excess)[n];
    1.32            int new_level = _level->maxLevel();
    1.33