0.1.3.145-beta1-symbian0.1.4.170-beta2-bb10appveyorimgbotreadme
Last change
on this file since 2f915f19f2 was
e664262f7d,
checked in by Oleksii Serdiuk, 17 years ago
|
Writing solving algorithm...
|
-
Property mode set to
100644
|
File size:
1.5 KB
|
Rev | Line | |
---|
[67e53c96d7] | 1 | /* |
---|
| 2 | * TSPSG - TSP Solver and Generator |
---|
| 3 | * Copyright (C) 2007 L¸ppa <lacontacts[at]gmail[dot]com> |
---|
| 4 | * |
---|
| 5 | * $Id$ |
---|
| 6 | * $URL$ |
---|
| 7 | * |
---|
| 8 | * This file is part of TSPSG. |
---|
| 9 | * |
---|
| 10 | * TSPSG is free software: you can redistribute it and/or modify |
---|
| 11 | * it under the terms of the GNU General Public License as published by |
---|
| 12 | * the Free Software Foundation, either version 3 of the License, or |
---|
| 13 | * (at your option) any later version. |
---|
| 14 | * |
---|
| 15 | * TSPSG is distributed in the hope that it will be useful, |
---|
| 16 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 18 | * GNU General Public License for more details. |
---|
| 19 | * |
---|
| 20 | * You should have received a copy of the GNU General Public License |
---|
| 21 | * along with TSPSG. If not, see <http://www.gnu.org/licenses/>. |
---|
| 22 | */ |
---|
| 23 | |
---|
| 24 | #include "tspsolver.h" |
---|
| 25 | |
---|
[e664262f7d] | 26 | CTSPSolver::CTSPSolver() |
---|
| 27 | { |
---|
| 28 | } |
---|
[67e53c96d7] | 29 | |
---|
[e664262f7d] | 30 | double CTSPSolver::findMinInRow(int nRow, tMatrix matrix) |
---|
| 31 | { |
---|
| 32 | double min = infinity; |
---|
| 33 | for (int k = 0; k < nCities; k++) |
---|
| 34 | if (min > matrix[nRow][k]) |
---|
| 35 | min = matrix[nRow][k]; |
---|
| 36 | return min == infinity ? 0 : min; |
---|
| 37 | } |
---|
[67e53c96d7] | 38 | |
---|
[e664262f7d] | 39 | double CTSPSolver::findMinInCol(int nCol, tMatrix matrix) |
---|
[67e53c96d7] | 40 | { |
---|
[e664262f7d] | 41 | double min = infinity; |
---|
| 42 | for (int k = 0; k < nCities; k++) |
---|
| 43 | if (min > matrix[k][nCol]) |
---|
| 44 | min = matrix[k][nCol]; |
---|
| 45 | return min == infinity ? 0 : min; |
---|
[67e53c96d7] | 46 | } |
---|
| 47 | |
---|
[e664262f7d] | 48 | sStep *CTSPSolver::solve(int numCities, tMatrix task) |
---|
[67e53c96d7] | 49 | { |
---|
| 50 | if (numCities <= 1) |
---|
| 51 | return NULL; |
---|
[e664262f7d] | 52 | nCities = numCities; |
---|
| 53 | sStep *step = new sStep(); |
---|
| 54 | step->matrix = task; |
---|
| 55 | root = step; |
---|
[67e53c96d7] | 56 | |
---|
[e664262f7d] | 57 | return step; |
---|
[67e53c96d7] | 58 | } |
---|
| 59 | |
---|
Note: See
TracBrowser
for help on using the repository browser.