Changes in / [1241:879fcb781086:1239:d1a48668ddb4] in lemon

Location:

lemon

Files:

• capacity_scaling.h (modified) (2 diffs)
• cost_scaling.h (modified) (2 diffs)
• cycle_canceling.h (modified) (2 diffs)
• network_simplex.h (modified) (2 diffs)

lemon/capacity_scaling.h

@@ -740 +740 @@
       if (_sum_supply > 0) return INFEASIBLE;
 
-      // Check lower and upper bounds
-      LEMON_DEBUG(checkBoundMaps(),
-          "Upper bounds must be greater or equal to the lower bounds");
-
-
       // Initialize vectors
       for (int i = 0; i != _root; ++i) {
@@ -837 +832 @@
 
       return OPTIMAL;
-    }
-    
-    // Check if the upper bound is greater or equal to the lower bound
-    // on each arc.
-    bool checkBoundMaps() {
-      for (int j = 0; j != _res_arc_num; ++j) {
-        if (_upper[j] < _lower[j]) return false;
-      }
-      return true;
     }
 

lemon/cost_scaling.h

@@ -764 +764 @@
       if (_sum_supply > 0) return INFEASIBLE;
 
-      // Check lower and upper bounds
-      LEMON_DEBUG(checkBoundMaps(),
-          "Upper bounds must be greater or equal to the lower bounds");
-
 
       // Initialize vectors
@@ -903 +899 @@
 
       return OPTIMAL;
-    }
-    
-    // Check if the upper bound is greater or equal to the lower bound
-    // on each arc.
-    bool checkBoundMaps() {
-      for (int j = 0; j != _res_arc_num; ++j) {
-        if (_upper[j] < _lower[j]) return false;
-      }
-      return true;
     }
 

lemon/cycle_canceling.h

@@ -671 +671 @@
       if (_sum_supply > 0) return INFEASIBLE;
 
-      // Check lower and upper bounds
-      LEMON_DEBUG(checkBoundMaps(),
-          "Upper bounds must be greater or equal to the lower bounds");
-
 
       // Initialize vectors
@@ -783 +779 @@
 
       return OPTIMAL;
-    }
-    
-    // Check if the upper bound is greater or equal to the lower bound
-    // on each arc.
-    bool checkBoundMaps() {
-      for (int j = 0; j != _res_arc_num; ++j) {
-        if (_upper[j] < _lower[j]) return false;
-      }
-      return true;
     }
 

lemon/network_simplex.h

@@ -1068 +1068 @@
              (_stype == LEQ && _sum_supply >= 0)) ) return false;
 
-      // Check lower and upper bounds
-      LEMON_DEBUG(checkBoundMaps(),
-          "Upper bounds must be greater or equal to the lower bounds");
-
       // Remove non-zero lower bounds
       if (_have_lower) {
@@ -1235 +1231 @@
       return true;
     }
-    
-    // Check if the upper bound is greater or equal to the lower bound
-    // on each arc.
-    bool checkBoundMaps() {
-      for (int j = 0; j != _arc_num; ++j) {
-        if (_upper[j] < _lower[j]) return false;
-      }
-      return true;
-    }
 
     // Find the join node