... | ... |
@@ -1077,7 +1077,7 @@ |
1077 | 1077 |
if (std::numeric_limits<Cost>::is_exact) { |
1078 | 1078 |
ART_COST = std::numeric_limits<Cost>::max() / 2 + 1; |
1079 | 1079 |
} else { |
1080 |
ART_COST = |
|
1080 |
ART_COST = 0; |
|
1081 | 1081 |
for (int i = 0; i != _arc_num; ++i) { |
1082 | 1082 |
if (_cost[i] > ART_COST) ART_COST = _cost[i]; |
1083 | 1083 |
} |
... | ... |
@@ -1589,7 +1589,7 @@ |
1589 | 1589 |
// optimality conditions |
1590 | 1590 |
if (_sum_supply == 0) { |
1591 | 1591 |
if (_stype == GEQ) { |
1592 |
Cost max_pot = std::numeric_limits<Cost>:: |
|
1592 |
Cost max_pot = -std::numeric_limits<Cost>::max(); |
|
1593 | 1593 |
for (int i = 0; i != _node_num; ++i) { |
1594 | 1594 |
if (_pi[i] > max_pot) max_pot = _pi[i]; |
1595 | 1595 |
} |
0 comments (0 inline)