Changeset e0fcac5f2c in tspsg for src/tspsolver.h

Timestamp:

Oct 24, 2009, 3:37:48 PM (15 years ago)

Author:

Oleksii Serdiuk

Branches:

0.1.3.145-beta1-symbian, 0.1.4.170-beta2-bb10, appveyor, imgbot, master, readme

Children:

8af59c4aa3

Parents:

85ad815b0b

Message:

• Finished documentation.
• Sorted all functions in .cpp files according to order of their declaration in .h files.

File:

• src/tspsolver.h (modified) (5 diffs)

src/tspsolver.h

@@ -1 +1 @@
 /*!
- * \class CTSPSolver
+ * \file tspsolver.h
  * \author Copyright &copy; 2007-2009 Lёppa <contacts[at]oleksii[dot]name>
- * \brief This class solves Travelling Salesman Problem task.
  *
  *  $Id$
  *  $URL$
+ *
+ * \brief Defines #tMatrix typedef, sStep struct and CTSPSolver class.
  *
  *  <b>TSPSG: TSP Solver and Generator</b>
@@ -23 +24 @@
  *  You should have received a copy of the GNU General Public License
  *  along with TSPSG.  If not, see <http://www.gnu.org/licenses/>.
- *
- * \todo TODO: Deletion of solution tree on destroy and cleanup.
  */
 
 #ifndef TSPSOLVER_H
 #define TSPSOLVER_H
-
-/*!
- * \file tspsolver.h
- * \brief Defines #tMatrix typedef, sStep struct and CTSPSolver class.
- */
 
 #include "globals.h"
@@ -67 +61 @@
 };
 
+/*!
+ * \brief This class solves Travelling Salesman Problem task.
+ * \author Copyright &copy; 2007-2009 Lёppa <contacts[at]oleksii[dot]name>
+ *
+ * \todo TODO: Deletion of solution tree on destroy and cleanup.
+ */
 class CTSPSolver
 {
@@ -74 +74 @@
         CTSPSolver();
         QString getSortedPath() const;
+        static QString getVersionId();
         bool isOptimal() const;
         sStep *solve(int, tMatrix, QWidget *parent = 0);
-        static QString getVersionId();
 
 private:
@@ -84 +84 @@
         QHash<int,int> route;
 //      QHash<int,int> forbidden;
+
         double align(tMatrix &);
         void cleanup();
         bool findCandidate(tMatrix, int &, int &);
+        double findMinInCol(int, tMatrix, int exr = -1);
         double findMinInRow(int, tMatrix, int exc = -1);
-        double findMinInCol(int, tMatrix, int exr = -1);
         bool hasSubCycles(int, int);
         void subCol(tMatrix &, int, double);