RhodeCode

      // Initialize artifical cost

      Cost ART_COST;

      if (std::numeric_limits<Cost>::is_exact) {

        ART_COST = std::numeric_limits<Cost>::max() / 2 + 1;

      } else {

        for (int i = 0; i != _arc_num; ++i) {

          if (_cost[i] > ART_COST) ART_COST = _cost[i];

        }

        ART_COST = (ART_COST + 1) * _node_num;

      }

      }

      // Shift potentials to meet the requirements of the GEQ/LEQ type

      // optimality conditions

      if (_sum_supply == 0) {

        if (_stype == GEQ) {

          for (int i = 0; i != _node_num; ++i) {

            if (_pi[i] > max_pot) max_pot = _pi[i];

          }

          if (max_pot > 0) {

            for (int i = 0; i != _node_num; ++i)

              _pi[i] -= max_pot;