Changeset 1270:dceba191c00d in lemon for lemon/howard_mmc.h

Timestamp:

08/09/13 11:28:17 (11 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

1271:fb1c7da561ce, 1381:e0ccc1f0268f

Phase:

public

Message:

Apply unify-sources.sh to the source tree

File:

• lemon/howard_mmc.h (modified) (4 diffs)

lemon/howard_mmc.h

@@ -3 +3 @@
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ -156 +156 @@
     /// these values.
     enum TerminationCause {
-      
+
       /// No directed cycle can be found in the digraph.
       NO_CYCLE = 0,
-    
+
       /// Optimal solution (minimum cycle mean) is found.
       OPTIMAL = 1,
@@ -357 +357 @@
     ///
     /// \param limit  The maximum allowed number of iterations during
-    /// the search process. Its default value implies that the algorithm 
+    /// the search process. Its default value implies that the algorithm
     /// runs until it finds the exact optimal solution.
     ///
     /// \return The termination cause of the search process.
-    /// For more information, see \ref TerminationCause. 
+    /// For more information, see \ref TerminationCause.
     TerminationCause findCycleMean(int limit = std::numeric_limits<int>::max()) {
       // Initialize and find strongly connected components
@@ -390 +390 @@
           _best_node = _curr_node;
         }
-        
+
         if (iter_limit_reached) break;
       }