COIN-OR::LEMON - Graph Library

Changeset 1103:c0c2f5c87aa6 in lemon-main for lemon/cost_scaling.h


Ignore:
Timestamp:
10/17/13 09:30:57 (7 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/cost_scaling.h

    r1102 r1103  
    252252
    253253    // Parameters of the problem
    254     bool _have_lower;
     254    bool _has_lower;
    255255    Value _sum_supply;
    256256    int _sup_node_num;
     
    368368    template <typename LowerMap>
    369369    CostScaling& lowerMap(const LowerMap& map) {
    370       _have_lower = true;
     370      _has_lower = true;
    371371      for (ArcIt a(_graph); a != INVALID; ++a) {
    372372        _lower[_arc_idf[a]] = map[a];
     
    563563        _scost[_reverse[j]] = 0;
    564564      }
    565       _have_lower = false;
     565      _has_lower = false;
    566566      return *this;
    567567    }
     
    775775      const Value MAX = std::numeric_limits<Value>::max();
    776776      int last_out;
    777       if (_have_lower) {
     777      if (_has_lower) {
    778778        for (int i = 0; i != _root; ++i) {
    779779          last_out = _first_out[i+1];
     
    832832        sup[n] = _supply[_node_id[n]];
    833833      }
    834       if (_have_lower) {
     834      if (_has_lower) {
    835835        for (ArcIt a(_graph); a != INVALID; ++a) {
    836836          int j = _arc_idf[a];
     
    986986
    987987      // Handle non-zero lower bounds
    988       if (_have_lower) {
     988      if (_has_lower) {
    989989        int limit = _first_out[_root];
    990990        for (int j = 0; j != limit; ++j) {
Note: See TracChangeset for help on using the changeset viewer.