lemon/cost_scaling.h
changeset 848 e05b2b48515a
parent 820 7ef7a5fbb85d
child 825 75e6020b19b1
child 830 75c97c3786d6
child 839 f3bc4e9b5f3a
equal deleted inserted replaced
5:fd6a223b2822 6:4664caad4f7a
   710 
   710 
   711   private:
   711   private:
   712 
   712 
   713     // Initialize the algorithm
   713     // Initialize the algorithm
   714     ProblemType init() {
   714     ProblemType init() {
   715       if (_res_node_num == 0) return INFEASIBLE;
   715       if (_res_node_num <= 1) return INFEASIBLE;
   716 
   716 
   717       // Check the sum of supply values
   717       // Check the sum of supply values
   718       _sum_supply = 0;
   718       _sum_supply = 0;
   719       for (int i = 0; i != _root; ++i) {
   719       for (int i = 0; i != _root; ++i) {
   720         _sum_supply += _supply[i];
   720         _sum_supply += _supply[i];