COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changes in / [1071:879fcb781086:1069:d1a48668ddb4] in lemon-main


Ignore:
Location:
lemon
Files:
4 edited

Legend:

Unmodified
Added
Removed

  • lemon/capacity_scaling.h

    r1071 r1053  
    740740      if (_sum_supply > 0) return INFEASIBLE;
    741741
    742       // Check lower and upper bounds
    743       LEMON_DEBUG(checkBoundMaps(),
    744           "Upper bounds must be greater or equal to the lower bounds");
    745 
    746 
    747742      // Initialize vectors
    748743      for (int i = 0; i != _root; ++i) {
    … …  
    837832
    838833      return OPTIMAL;
    839     }
    840    
    841     // Check if the upper bound is greater or equal to the lower bound
    842     // on each arc.
    843     bool checkBoundMaps() {
    844       for (int j = 0; j != _res_arc_num; ++j) {
    845         if (_upper[j] < _lower[j]) return false;
    846       }
    847       return true;
    848834    }
    849835

  • lemon/cost_scaling.h

    r1071 r1053  
    764764      if (_sum_supply > 0) return INFEASIBLE;
    765765
    766       // Check lower and upper bounds
    767       LEMON_DEBUG(checkBoundMaps(),
    768           "Upper bounds must be greater or equal to the lower bounds");
    769 
    770766
    771767      // Initialize vectors
    … …  
    903899
    904900      return OPTIMAL;
    905     }
    906    
    907     // Check if the upper bound is greater or equal to the lower bound
    908     // on each arc.
    909     bool checkBoundMaps() {
    910       for (int j = 0; j != _res_arc_num; ++j) {
    911         if (_upper[j] < _lower[j]) return false;
    912       }
    913       return true;
    914901    }
    915902

  • lemon/cycle_canceling.h

    r1071 r1053  
    671671      if (_sum_supply > 0) return INFEASIBLE;
    672672
    673       // Check lower and upper bounds
    674       LEMON_DEBUG(checkBoundMaps(),
    675           "Upper bounds must be greater or equal to the lower bounds");
    676 
    677673
    678674      // Initialize vectors
    … …  
    783779
    784780      return OPTIMAL;
    785     }
    786    
    787     // Check if the upper bound is greater or equal to the lower bound
    788     // on each arc.
    789     bool checkBoundMaps() {
    790       for (int j = 0; j != _res_arc_num; ++j) {
    791         if (_upper[j] < _lower[j]) return false;
    792       }
    793       return true;
    794781    }
    795782

  • lemon/network_simplex.h

    r1071 r1053  
    10681068             (_stype == LEQ && _sum_supply >= 0)) ) return false;
    10691069
    1070       // Check lower and upper bounds
    1071       LEMON_DEBUG(checkBoundMaps(),
    1072           "Upper bounds must be greater or equal to the lower bounds");
    1073 
    10741070      // Remove non-zero lower bounds
    10751071      if (_have_lower) {
    … …  
    12351231      return true;
    12361232    }
    1237    
    1238     // Check if the upper bound is greater or equal to the lower bound
    1239     // on each arc.
    1240     bool checkBoundMaps() {
    1241       for (int j = 0; j != _arc_num; ++j) {
    1242         if (_upper[j] < _lower[j]) return false;
    1243       }
    1244       return true;
    1245     }
    12461233
    12471234    // Find the join node
Note: See TracChangeset for help on using the changeset viewer.