Changeset 1297:c0c2f5c87aa6 in lemon for lemon/cost_scaling.h
- Timestamp:
- 10/17/13 09:30:57 (11 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/cost_scaling.h
r1296 r1297 252 252 253 253 // Parameters of the problem 254 bool _ha ve_lower;254 bool _has_lower; 255 255 Value _sum_supply; 256 256 int _sup_node_num; … … 368 368 template <typename LowerMap> 369 369 CostScaling& lowerMap(const LowerMap& map) { 370 _ha ve_lower = true;370 _has_lower = true; 371 371 for (ArcIt a(_graph); a != INVALID; ++a) { 372 372 _lower[_arc_idf[a]] = map[a]; … … 563 563 _scost[_reverse[j]] = 0; 564 564 } 565 _ha ve_lower = false;565 _has_lower = false; 566 566 return *this; 567 567 } … … 775 775 const Value MAX = std::numeric_limits<Value>::max(); 776 776 int last_out; 777 if (_ha ve_lower) {777 if (_has_lower) { 778 778 for (int i = 0; i != _root; ++i) { 779 779 last_out = _first_out[i+1]; … … 832 832 sup[n] = _supply[_node_id[n]]; 833 833 } 834 if (_ha ve_lower) {834 if (_has_lower) { 835 835 for (ArcIt a(_graph); a != INVALID; ++a) { 836 836 int j = _arc_idf[a]; … … 986 986 987 987 // Handle non-zero lower bounds 988 if (_ha ve_lower) {988 if (_has_lower) { 989 989 int limit = _first_out[_root]; 990 990 for (int j = 0; j != limit; ++j) {
Note: See TracChangeset
for help on using the changeset viewer.