COIN-OR::LEMON - Graph Library

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

    r1296 r1297  
    196196
    197197    // Parameters of the problem
    198     bool _have_lower;
     198    bool _has_lower;
    199199    Value _sum_supply;
    200200
     
    279279    template <typename LowerMap>
    280280    CycleCanceling& lowerMap(const LowerMap& map) {
    281       _have_lower = true;
     281      _has_lower = true;
    282282      for (ArcIt a(_graph); a != INVALID; ++a) {
    283283        _lower[_arc_idf[a]] = map[a];
     
    471471        _cost[_reverse[j]] = 0;
    472472      }
    473       _have_lower = false;
     473      _has_lower = false;
    474474      return *this;
    475475    }
     
    684684      const Value MAX = std::numeric_limits<Value>::max();
    685685      int last_out;
    686       if (_have_lower) {
     686      if (_has_lower) {
    687687        for (int i = 0; i != _root; ++i) {
    688688          last_out = _first_out[i+1];
     
    727727        sup[n] = _supply[_node_id[n]];
    728728      }
    729       if (_have_lower) {
     729      if (_has_lower) {
    730730        for (ArcIt a(_graph); a != INVALID; ++a) {
    731731          int j = _arc_idf[a];
     
    835835
    836836      // Handle non-zero lower bounds
    837       if (_have_lower) {
     837      if (_has_lower) {
    838838        int limit = _first_out[_root];
    839839        for (int j = 0; j != limit; ++j) {
Note: See TracChangeset for help on using the changeset viewer.