/* -*- 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

     ///

     ///

     /// Enum type containing constants for the different causes of search

     /// Enum type containing constants for the different causes of search

     /// termination. The \ref findCycleMean() function returns one of

     /// termination. The \ref findCycleMean() function returns one of

     /// these values.

     /// these values.

     enum TerminationCause {

     enum TerminationCause {

       /// No directed cycle can be found in the digraph.

       /// No directed cycle can be found in the digraph.

       NO_CYCLE = 0,

       NO_CYCLE = 0,

       /// Optimal solution (minimum cycle mean) is found.

       /// Optimal solution (minimum cycle mean) is found.

       OPTIMAL = 1,

       OPTIMAL = 1,

       /// The iteration count limit is reached.

       /// The iteration count limit is reached.

       ITERATION_LIMIT

       ITERATION_LIMIT

     /// approximate solution is provided, which corresponds to a directed

     /// approximate solution is provided, which corresponds to a directed

     /// cycle whose mean cost is relatively small, but not necessarily

     /// cycle whose mean cost is relatively small, but not necessarily

     /// minimal.

     /// minimal.

     ///

     ///

     /// \param limit  The maximum allowed number of iterations during

     /// \param limit  The maximum allowed number of iterations during

     /// runs until it finds the exact optimal solution.

     /// runs until it finds the exact optimal solution.

     ///

     ///

     /// \return The termination cause of the search process.

     /// \return The termination cause of the search process.

     TerminationCause findCycleMean(int limit = std::numeric_limits<int>::max()) {

     TerminationCause findCycleMean(int limit = std::numeric_limits<int>::max()) {

       // Initialize and find strongly connected components

       // Initialize and find strongly connected components

       init();

       init();

       findComponents();

       findComponents();

           _best_found = true;

           _best_found = true;

           _best_cost = _curr_cost;

           _best_cost = _curr_cost;

           _best_size = _curr_size;

           _best_size = _curr_size;

           _best_node = _curr_node;

           _best_node = _curr_node;

         }

         }

         if (iter_limit_reached) break;

         if (iter_limit_reached) break;

       }

       }

       if (iter_limit_reached) {

       if (iter_limit_reached) {

         return ITERATION_LIMIT;

         return ITERATION_LIMIT;