/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

         }

         }

       }

       }

       return OPTIMAL;

       return OPTIMAL;

     }

     }

     // Check if the upper bound is greater or equal to the lower bound

     // Check if the upper bound is greater or equal to the lower bound

     // on each arc.

     // on each arc.

     bool checkBoundMaps() {

     bool checkBoundMaps() {

       for (int j = 0; j != _res_arc_num; ++j) {

       for (int j = 0; j != _res_arc_num; ++j) {

         if (_upper[j] < _lower[j]) return false;

         if (_upper[j] < _lower[j]) return false;

       SPath cycle;

       SPath cycle;

       HwMmc hw_mmc(_sgr, _cost_map);

       HwMmc hw_mmc(_sgr, _cost_map);

       hw_mmc.cycle(cycle);

       hw_mmc.cycle(cycle);

       buildResidualNetwork();

       buildResidualNetwork();

       while (true) {

       while (true) {

         typename HwMmc::TerminationCause hw_tc =

         typename HwMmc::TerminationCause hw_tc =

             hw_mmc.findCycleMean(hw_iter_limit);

             hw_mmc.findCycleMean(hw_iter_limit);

         if (hw_tc == HwMmc::ITERATION_LIMIT) {

         if (hw_tc == HwMmc::ITERATION_LIMIT) {

           // Howard's algorithm reached the iteration limit, start a

           // Howard's algorithm reached the iteration limit, start a

           // strongly polynomial algorithm instead

           // strongly polynomial algorithm instead

         } else {

         } else {

           // Find a minimum mean cycle (Howard algorithm)

           // Find a minimum mean cycle (Howard algorithm)

           if (!(hw_tc == HwMmc::OPTIMAL && hw_mmc.cycleCost() < 0)) break;

           if (!(hw_tc == HwMmc::OPTIMAL && hw_mmc.cycleCost() < 0)) break;

           hw_mmc.findCycle();

           hw_mmc.findCycle();

         }

         }

         // Compute delta value

         // Compute delta value

         Value delta = INF;

         Value delta = INF;

         for (SPathArcIt a(cycle); a != INVALID; ++a) {

         for (SPathArcIt a(cycle); a != INVALID; ++a) {

           Value d = _res_cap[_id_vec[_sgr.id(a)]];

           Value d = _res_cap[_id_vec[_sgr.id(a)]];

           if (d < delta) delta = d;

           if (d < delta) delta = d;