COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
08/09/13 11:28:17 (6 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:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/howard_mmc.h

    r1250 r1270  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2010
     5 * Copyright (C) 2003-2013
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    156156    /// these values.
    157157    enum TerminationCause {
    158      
     158
    159159      /// No directed cycle can be found in the digraph.
    160160      NO_CYCLE = 0,
    161    
     161
    162162      /// Optimal solution (minimum cycle mean) is found.
    163163      OPTIMAL = 1,
     
    357357    ///
    358358    /// \param limit  The maximum allowed number of iterations during
    359     /// the search process. Its default value implies that the algorithm 
     359    /// the search process. Its default value implies that the algorithm
    360360    /// runs until it finds the exact optimal solution.
    361361    ///
    362362    /// \return The termination cause of the search process.
    363     /// For more information, see \ref TerminationCause. 
     363    /// For more information, see \ref TerminationCause.
    364364    TerminationCause findCycleMean(int limit = std::numeric_limits<int>::max()) {
    365365      // Initialize and find strongly connected components
     
    390390          _best_node = _curr_node;
    391391        }
    392        
     392
    393393        if (iter_limit_reached) break;
    394394      }
Note: See TracChangeset for help on using the changeset viewer.