1.1 --- a/lemon/howard_mmc.h	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/lemon/howard_mmc.h	Fri Aug 09 11:28:17 2013 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -155,10 +155,10 @@
    1.13      /// termination. The \ref findCycleMean() function returns one of
    1.14      /// these values.
    1.15      enum TerminationCause {
    1.16 -      
    1.17 +
    1.18        /// No directed cycle can be found in the digraph.
    1.19        NO_CYCLE = 0,
    1.20 -    
    1.21 +
    1.22        /// Optimal solution (minimum cycle mean) is found.
    1.23        OPTIMAL = 1,
    1.24  
    1.25 @@ -356,11 +356,11 @@
    1.26      /// minimal.
    1.27      ///
    1.28      /// \param limit  The maximum allowed number of iterations during
    1.29 -    /// the search process. Its default value implies that the algorithm 
    1.30 +    /// the search process. Its default value implies that the algorithm
    1.31      /// runs until it finds the exact optimal solution.
    1.32      ///
    1.33      /// \return The termination cause of the search process.
    1.34 -    /// For more information, see \ref TerminationCause. 
    1.35 +    /// For more information, see \ref TerminationCause.
    1.36      TerminationCause findCycleMean(int limit = std::numeric_limits<int>::max()) {
    1.37        // Initialize and find strongly connected components
    1.38        init();
    1.39 @@ -389,7 +389,7 @@
    1.40            _best_size = _curr_size;
    1.41            _best_node = _curr_node;
    1.42          }
    1.43 -        
    1.44 +
    1.45          if (iter_limit_reached) break;
    1.46        }
    1.47