# HG changeset patch
# User Alpar Juttner <alpar@cs.elte.hu>
# Date 1272875092 -7200
# Node ID cbf32bf9595467fe394c25fa404c7d4283e43eb6
# Parent  e26ad33d1fbc57e91d9ec58caebe40fe2b43d298# Parent  5205145fabf68906e789911c2fc39968fd655f6e
Merge bugfix #368 to branch 1.2

diff -r e26ad33d1fbc -r cbf32bf95954 lemon/network_simplex.h
--- a/lemon/network_simplex.h	Mon Apr 12 17:00:05 2010 +0200
+++ b/lemon/network_simplex.h	Mon May 03 10:24:52 2010 +0200
@@ -1077,7 +1077,7 @@
       if (std::numeric_limits<Cost>::is_exact) {
         ART_COST = std::numeric_limits<Cost>::max() / 2 + 1;
       } else {
-        ART_COST = std::numeric_limits<Cost>::min();
+        ART_COST = 0;
         for (int i = 0; i != _arc_num; ++i) {
           if (_cost[i] > ART_COST) ART_COST = _cost[i];
         }
@@ -1589,7 +1589,7 @@
       // optimality conditions
       if (_sum_supply == 0) {
         if (_stype == GEQ) {
-          Cost max_pot = std::numeric_limits<Cost>::min();
+          Cost max_pot = -std::numeric_limits<Cost>::max();
           for (int i = 0; i != _node_num; ++i) {
             if (_pi[i] > max_pot) max_pot = _pi[i];
           }