Changeset 1297:c0c2f5c87aa6 in lemon for lemon/cycle_canceling.h
 Timestamp:
 10/17/13 09:30:57 (11 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cycle_canceling.h
r1296 r1297 196 196 197 197 // Parameters of the problem 198 bool _ha ve_lower;198 bool _has_lower; 199 199 Value _sum_supply; 200 200 … … 279 279 template <typename LowerMap> 280 280 CycleCanceling& lowerMap(const LowerMap& map) { 281 _ha ve_lower = true;281 _has_lower = true; 282 282 for (ArcIt a(_graph); a != INVALID; ++a) { 283 283 _lower[_arc_idf[a]] = map[a]; … … 471 471 _cost[_reverse[j]] = 0; 472 472 } 473 _ha ve_lower = false;473 _has_lower = false; 474 474 return *this; 475 475 } … … 684 684 const Value MAX = std::numeric_limits<Value>::max(); 685 685 int last_out; 686 if (_ha ve_lower) {686 if (_has_lower) { 687 687 for (int i = 0; i != _root; ++i) { 688 688 last_out = _first_out[i+1]; … … 727 727 sup[n] = _supply[_node_id[n]]; 728 728 } 729 if (_ha ve_lower) {729 if (_has_lower) { 730 730 for (ArcIt a(_graph); a != INVALID; ++a) { 731 731 int j = _arc_idf[a]; … … 835 835 836 836 // Handle nonzero lower bounds 837 if (_ha ve_lower) {837 if (_has_lower) { 838 838 int limit = _first_out[_root]; 839 839 for (int j = 0; j != limit; ++j) {
Note: See TracChangeset
for help on using the changeset viewer.