COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
10/17/13 09:30:57 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Rename field in min cost flow codes (#478)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/capacity_scaling.h

    r1296 r1297  
    161161
    162162    // Parameters of the problem
    163     bool _have_lower;
     163    bool _has_lower;
    164164    Value _sum_supply;
    165165
     
    354354    template <typename LowerMap>
    355355    CapacityScaling& lowerMap(const LowerMap& map) {
    356       _have_lower = true;
     356      _has_lower = true;
    357357      for (ArcIt a(_graph); a != INVALID; ++a) {
    358358        _lower[_arc_idf[a]] = map[a];
     
    540540        _cost[j] = _forward[j] ? 1 : -1;
    541541      }
    542       _have_lower = false;
     542      _has_lower = false;
    543543      return *this;
    544544    }
     
    751751      const Value MAX = std::numeric_limits<Value>::max();
    752752      int last_out;
    753       if (_have_lower) {
     753      if (_has_lower) {
    754754        for (int i = 0; i != _root; ++i) {
    755755          last_out = _first_out[i+1];
     
    854854
    855855      // Handle non-zero lower bounds
    856       if (_have_lower) {
     856      if (_has_lower) {
    857857        int limit = _first_out[_root];
    858858        for (int j = 0; j != limit; ++j) {
Note: See TracChangeset for help on using the changeset viewer.