Last change
on this file since 12 was
12,
checked in by laleppa, 17 years ago
|
Started writing solving algorithm
|
-
Property svn:keywords set to
Id URL
|
File size:
1.4 KB
|
Line | |
---|
1 | /* |
---|
2 | * TSPSG - TSP Solver and Generator |
---|
3 | * Copyright (C) 2007 L¸ppa <lacontacts[at]gmail[dot]com> |
---|
4 | * |
---|
5 | * $Id: tspsolver.cpp 12 2007-10-20 19:16:42Z 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 | // Temoporary matrix for testing algorithm |
---|
27 | double testmatrix[] = { |
---|
28 | infinity, 6, 7, 3, 4, |
---|
29 | 9, infinity, 6, 9, 10, |
---|
30 | 6, 9, infinity, 5, 3, |
---|
31 | 3, 10, 4, infinity, 2, |
---|
32 | 5, 1, 1, 9, infinity |
---|
33 | }; |
---|
34 | |
---|
35 | |
---|
36 | CTSPSolver::CTSPSolver() |
---|
37 | { |
---|
38 | } |
---|
39 | |
---|
40 | sStep *CTSPSolver::solve(int numCities, double *task) |
---|
41 | { |
---|
42 | if (numCities <= 1) |
---|
43 | return NULL; |
---|
44 | // Temporary debug code :-) |
---|
45 | task = &testmatrix[0]; |
---|
46 | numCities = 5; |
---|
47 | //*/ |
---|
48 | sStep step; |
---|
49 | step.matrix = new double(numCities * numCities); |
---|
50 | memcpy(step.matrix,task,sizeof(double) * numCities * numCities); |
---|
51 | |
---|
52 | return NULL; |
---|
53 | } |
---|
54 | |
---|
Note: See
TracBrowser
for help on using the repository browser.