1 | /* |
---|
2 | * TSPSG - TSP Solver and Generator |
---|
3 | * Copyright (C) 2007 L¸ppa <lacontacts[at]gmail[dot]com> |
---|
4 | * |
---|
5 | * $Id: tspsolver.cpp 13 2007-10-21 13:07:21Z laleppa $ |
---|
6 | * $URL: https://tspsg.svn.sourceforge.net/svnroot/tspsg/trunk/src/tspsolver.cpp $ |
---|
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 | |
---|
26 | CTSPSolver::CTSPSolver() |
---|
27 | { |
---|
28 | } |
---|
29 | |
---|
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 | } |
---|
38 | |
---|
39 | double CTSPSolver::findMinInCol(int nCol, tMatrix matrix) |
---|
40 | { |
---|
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; |
---|
46 | } |
---|
47 | |
---|
48 | sStep *CTSPSolver::solve(int numCities, tMatrix task) |
---|
49 | { |
---|
50 | if (numCities <= 1) |
---|
51 | return NULL; |
---|
52 | nCities = numCities; |
---|
53 | sStep *step = new sStep(); |
---|
54 | step->matrix = task; |
---|
55 | root = step; |
---|
56 | |
---|
57 | return step; |
---|
58 | } |
---|
59 | |
---|