1.1 --- a/lemon/capacity_scaling.h	Thu Oct 17 09:29:37 2013 +0200
     1.2 +++ b/lemon/capacity_scaling.h	Thu Oct 17 09:30:57 2013 +0200
     1.3 @@ -160,7 +160,7 @@
     1.4      int _root;
     1.5  
     1.6      // Parameters of the problem
     1.7 -    bool _have_lower;
     1.8 +    bool _has_lower;
     1.9      Value _sum_supply;
    1.10  
    1.11      // Data structures for storing the digraph
    1.12 @@ -353,7 +353,7 @@
    1.13      /// \return <tt>(*this)</tt>
    1.14      template <typename LowerMap>
    1.15      CapacityScaling& lowerMap(const LowerMap& map) {
    1.16 -      _have_lower = true;
    1.17 +      _has_lower = true;
    1.18        for (ArcIt a(_graph); a != INVALID; ++a) {
    1.19          _lower[_arc_idf[a]] = map[a];
    1.20        }
    1.21 @@ -539,7 +539,7 @@
    1.22          _upper[j] = INF;
    1.23          _cost[j] = _forward[j] ? 1 : -1;
    1.24        }
    1.25 -      _have_lower = false;
    1.26 +      _has_lower = false;
    1.27        return *this;
    1.28      }
    1.29  
    1.30 @@ -750,7 +750,7 @@
    1.31        // Remove non-zero lower bounds
    1.32        const Value MAX = std::numeric_limits<Value>::max();
    1.33        int last_out;
    1.34 -      if (_have_lower) {
    1.35 +      if (_has_lower) {
    1.36          for (int i = 0; i != _root; ++i) {
    1.37            last_out = _first_out[i+1];
    1.38            for (int j = _first_out[i]; j != last_out; ++j) {
    1.39 @@ -853,7 +853,7 @@
    1.40          pt = startWithoutScaling();
    1.41  
    1.42        // Handle non-zero lower bounds
    1.43 -      if (_have_lower) {
    1.44 +      if (_has_lower) {
    1.45          int limit = _first_out[_root];
    1.46          for (int j = 0; j != limit; ++j) {
    1.47            if (_forward[j]) _res_cap[_reverse[j]] += _lower[j];