source: tspsg-svn/trunk/src/tspsolver.h @ 94

Last change on this file since 94 was 90, checked in by laleppa, 15 years ago
  • Property svn:keywords set to Id URL
File size: 3.2 KB
RevLine 
[65]1/*!
[67]2 * \file tspsolver.h
[87]3 * \author Copyright &copy; 2007-2010 Lёppa <contacts[at]oleksii[dot]name>
[12]4 *
5 *  $Id: tspsolver.h 90 2010-02-17 16:54:05Z laleppa $
6 *  $URL: https://tspsg.svn.sourceforge.net/svnroot/tspsg/trunk/src/tspsolver.h $
7 *
[76]8 * \brief Defines #TMatrix typedef, SCandidate and SStep structs and CTSPSolver class.
[67]9 *
[65]10 *  <b>TSPSG: TSP Solver and Generator</b>
11 *
[12]12 *  This file is part of TSPSG.
13 *
14 *  TSPSG is free software: you can redistribute it and/or modify
15 *  it under the terms of the GNU General Public License as published by
16 *  the Free Software Foundation, either version 3 of the License, or
17 *  (at your option) any later version.
18 *
19 *  TSPSG is distributed in the hope that it will be useful,
20 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
21 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
22 *  GNU General Public License for more details.
23 *
24 *  You should have received a copy of the GNU General Public License
25 *  along with TSPSG.  If not, see <http://www.gnu.org/licenses/>.
26 */
27
28#ifndef TSPSOLVER_H
29#define TSPSOLVER_H
30
[31]31#include "globals.h"
[12]32
[64]33#include "tspmodel.h"
34
[65]35//! A matrix of city-to-city travel costs.
[89]36typedef QList<QList<double> > TMatrix;
[13]37
[65]38/*!
[74]39 * \brief A structure that represents a candidate for branching.
40 */
[76]41struct SCandidate {
[74]42        int nRow; //!< A zero-based row number of the candidate
43        int nCol; //!< A zero-based column number of the candidate
44
45        //! Assigns default values
[76]46        SCandidate() {
[74]47                nCol = nRow = -1;
48        }
49        //! An operator == implementation
[76]50        bool operator ==(const SCandidate &cand) const {
[74]51                return ((cand.nRow == nRow) && (cand.nCol == nCol));
52        }
53};
54
55/*!
[65]56 * \brief This structure represents one step of solving.
57 *
58 *  A tree of such elements will represent the solving process.
59 */
[74]60struct SStep {
61        TMatrix matrix; //!< This step's matrix
[89]62        double price; //!< The price of travel to this step
[76]63        SCandidate candidate; //!< A candiadate for branching in the current matrix
64        QList<SCandidate> alts; //!< A list of alternative branching candidates
[90]65        SStep *pNode; //!< Pointer to the parent step
[74]66        SStep *plNode; //!< Pointer to the left branch step
67        SStep *prNode; //!< Pointer to the right branch step
[65]68
69        //! Assigns default values
[74]70        SStep() {
71                price = -1;
[90]72                pNode = plNode = prNode = NULL;
[65]73        }
[12]74};
75
[67]76/*!
77 * \brief This class solves Travelling Salesman Problem task.
[87]78 * \author Copyright &copy; 2007-2010 Lёppa <contacts[at]oleksii[dot]name>
[67]79 */
[12]80class CTSPSolver
81{
[42]82        Q_DECLARE_TR_FUNCTIONS(CTSPSolver)
83
[12]84public:
85        CTSPSolver();
[60]86        QString getSortedPath() const;
[67]87        static QString getVersionId();
[60]88        bool isOptimal() const;
[74]89        SStep *solve(int numCities, TMatrix task, QWidget *parent = 0);
90        ~CTSPSolver();
[42]91
[13]92private:
[60]93        bool mayNotBeOptimal;
[13]94        int nCities;
[74]95        SStep *root;
[42]96        QHash<int,int> route;
[50]97//      QHash<int,int> forbidden;
[67]98
[89]99        double align(TMatrix &matrix);
[42]100        void cleanup();
[90]101        void deleteTree(SStep *&root);
[76]102        QList<SCandidate> findCandidate(const TMatrix &matrix, int &nRow, int &nCol) const;
[89]103        double findMinInCol(int nCol, const TMatrix &matrix, int exr = -1) const;
104        double findMinInRow(int nRow, const TMatrix &matrix, int exc = -1) const;
[71]105        bool hasSubCycles(int nRow, int nCol) const;
[89]106        void subCol(TMatrix &matrix, int nCol, double val);
107        void subRow(TMatrix &matrix, int nRow, double val);
[12]108};
109
110#endif // TSPSOLVER_H
Note: See TracBrowser for help on using the repository browser.