Changeset 1240:ee9bac10f58e in lemon
 Timestamp:
 03/16/13 16:20:41 (7 years ago)
 Branch:
 default
 Children:
 1241:879fcb781086, 1296:330264b171cf
 Phase:
 public
 Location:
 lemon
 Files:

 4 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r1166 r1240 738 738 if (_sum_supply > 0) return INFEASIBLE; 739 739 740 // Check lower and upper bounds 741 LEMON_DEBUG(checkBoundMaps(), 742 "Upper bounds must be greater or equal to the lower bounds"); 743 744 740 745 // Initialize vectors 741 746 for (int i = 0; i != _root; ++i) { … … 830 835 831 836 return OPTIMAL; 837 } 838 839 // Check if the upper bound is greater or equal to the lower bound 840 // on each arc. 841 bool checkBoundMaps() { 842 for (int j = 0; j != _res_arc_num; ++j) { 843 if (_upper[j] < _lower[j]) return false; 844 } 845 return true; 832 846 } 833 847 
lemon/cost_scaling.h
r1165 r1240 762 762 if (_sum_supply > 0) return INFEASIBLE; 763 763 764 // Check lower and upper bounds 765 LEMON_DEBUG(checkBoundMaps(), 766 "Upper bounds must be greater or equal to the lower bounds"); 767 764 768 765 769 // Initialize vectors … … 897 901 898 902 return OPTIMAL; 903 } 904 905 // Check if the upper bound is greater or equal to the lower bound 906 // on each arc. 907 bool checkBoundMaps() { 908 for (int j = 0; j != _res_arc_num; ++j) { 909 if (_upper[j] < _lower[j]) return false; 910 } 911 return true; 899 912 } 900 913 
lemon/cycle_canceling.h
r1179 r1240 671 671 if (_sum_supply > 0) return INFEASIBLE; 672 672 673 // Check lower and upper bounds 674 LEMON_DEBUG(checkBoundMaps(), 675 "Upper bounds must be greater or equal to the lower bounds"); 676 673 677 674 678 // Initialize vectors … … 779 783 780 784 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; 781 794 } 782 795 
lemon/network_simplex.h
r1166 r1240 1068 1068 (_stype == LEQ && _sum_supply >= 0)) ) return false; 1069 1069 1070 // Check lower and upper bounds 1071 LEMON_DEBUG(checkBoundMaps(), 1072 "Upper bounds must be greater or equal to the lower bounds"); 1073 1070 1074 // Remove nonzero lower bounds 1071 1075 if (_have_lower) { … … 1231 1235 return true; 1232 1236 } 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 } 1233 1246 1234 1247 // Find the join node
Note: See TracChangeset
for help on using the changeset viewer.