lemon-main: comparison lemon/grosso_locatelli_pullan

equal deleted inserted replaced

-:571f99a50202
+:7fb203c59459
 /* -*- mode: C++; indent-tabs-mode: nil; -*-
 *
 * 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).
 *
 * Permission to use, modify and distribute this software is granted
 * provided that this copyright notice appears in all copies. For
 IntNodeMap _id;
 // Internal matrix representation of the graph
 BoolMatrix _gr;
 int _n;
 // Search options
 bool _delta_based_restart;
 int _restart_delta_limit;
 // Search limits
 int _iteration_limit;
 int _step_limit;
 int _size_limit;
 initOptions();
 }
 /// \name Execution Control
 /// The \ref run() function can be used to execute the algorithm.\n
 /// The functions \ref iterationLimit(int), \ref stepLimit(int), and
 /// \ref sizeLimit(int) can be used to specify various limits for the
 /// search process.
 /// @{
 /// \brief Sets the maximum number of iterations.
 ///
 /// This function sets the maximum number of iterations.
 /// Each iteration of the algorithm finds a maximal clique (but not
 /// necessarily the largest one) by performing several search steps
 ///
 /// This limit controls the running time and the success of the
 /// algorithm. For larger values, the algorithm runs slower, but it more
 /// likely finds larger cliques. For smaller values, the algorithm is
 /// faster but probably gives worse results.
 ///
 /// The default value is \c 1000.
 /// \c -1 means that number of iterations is not limited.
 ///
 /// \warning You should specify a reasonable limit for the number of
 /// iterations and/or the number of search steps.
 /// \sa sizeLimit(int)
 GrossoLocatelliPullanMc& iterationLimit(int limit) {
 _iteration_limit = limit;
 return *this;
 }
 /// \brief Sets the maximum number of search steps.
 ///
 /// This function sets the maximum number of elementary search steps.
 /// Each iteration of the algorithm finds a maximal clique (but not
 /// necessarily the largest one) by performing several search steps
 ///
 /// This limit controls the running time and the success of the
 /// algorithm. For larger values, the algorithm runs slower, but it more
 /// likely finds larger cliques. For smaller values, the algorithm is
 /// faster but probably gives worse results.
 ///
 /// The default value is \c -1, which means that number of steps
 /// is not limited explicitly. However, the number of iterations is
 /// limited and each iteration performs a finite number of search steps.
 ///
 /// \warning You should specify a reasonable limit for the number of
 /// \sa sizeLimit(int)
 GrossoLocatelliPullanMc& stepLimit(int limit) {
 _step_limit = limit;
 return *this;
 }
 /// \brief Sets the desired clique size.
 ///
 /// This function sets the desired clique size that serves as a search
 /// limit. If a clique of this size (or a larger one) is found, then the
 /// algorithm terminates.
 ///
 /// This function is especially useful if you know an exact upper bound
 /// for the size of the cliques in the graph or if any clique above
 /// a certain size limit is sufficient for your application.
 ///
 /// The default value is \c -1, which means that the size limit is set to
 /// the number of nodes in the graph.
 ///
 /// \return <tt>(*this)</tt>
 ///
 /// \sa stepLimit(int)
 GrossoLocatelliPullanMc& sizeLimit(int limit) {
 _size_limit = limit;
 return *this;
 }
 /// \brief The maximum number of iterations.
 ///
 /// This function gives back the maximum number of iterations.
 /// \c -1 means that no limit is specified.
 ///
 /// \sa iterationLimit(int)
 int iterationLimit() const {
 return _iteration_limit;
 }
 /// \brief The maximum number of search steps.
 ///
 /// This function gives back the maximum number of search steps.
 /// \c -1 means that no limit is specified.
 ///
 /// \sa stepLimit(int)
 int stepLimit() const {
 return _step_limit;
 }
 /// \brief The desired clique size.
 ///
 /// This function gives back the desired clique size that serves as a
 /// search limit. \c -1 means that this limit is set to the number of
 /// nodes in the graph.
 /// @}
 /// \name Query Functions
 /// The results of the algorithm can be obtained using these functions.\n
 /// The run() function must be called before using them.
 /// @{
 /// \brief The size of the found clique
 ///
 };
 /// @}
 private:
 // Initialize search options and limits
 void initOptions() {
 // Search options
 _delta_based_restart = true;
 _restart_delta_limit = 4;
 // Search limits
 _iteration_limit = 1000;
 _step_limit = -1;             // this is disabled by default
 _size_limit = -1;             // this is disabled by default
 }

changeset 1165	e0ccc1f0268f
parent 1053	1c978b5bcc65