-
Notifications
You must be signed in to change notification settings - Fork 0
/
exhaustive.cpp
146 lines (123 loc) · 3.51 KB
/
exhaustive.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include "math.h"
using namespace std;
// Basic Data structure for a point
class point{
public:
point(int x, int y, int id){
_x = x;
_y = y;
_id = id;
}
int getX(){
return _x;
}
int getY(){
return _y;
}
int getID(){
return _id;
}
void setFlag(){
_visited = true;
}
bool getFlag(){
return _visited;
}
private:
int _x = 0;
int _y = 0;
int _id = 0;
bool _visited = false;
};
static vector<point> pts;
void ReadFile(string file_name){
ifstream input_file(file_name);
if(!input_file.is_open()){
cout << "The file is not existed. Please check the input file name." << endl;
exit(0);
} else {
int num;
input_file >> num;
for(int i = 0; i < num; i++){
int x;
input_file >> x;
int y;
input_file >> y;
point p(x,y,i);
pts.push_back(p);
}
}
input_file.close();
}
float CalcDist(point &ptr1, point &ptr2){
int x1 = ptr1.getX();
int y1 = ptr1.getY();
int x2 = ptr2.getX();
int y2 = ptr2.getY();
float xDist = (x1 - x2)*(x1 - x2);
float yDist = (y1 - y2)*(y1 - y2);
float distance = sqrt(xDist+yDist);
return distance;
}
float traveledDistance(vector<int> &route) {
float distance = CalcDist(pts[route[0]],pts[route[route.size()-1]]);
for(int i = 1; i < route.size(); i++){
distance += CalcDist(pts[route[i-1]],pts[route[i]]);
}
return distance;
}
void BruteForce(){
cout << "Processing =============================================" << endl;
vector<int> route;
for(int i = 0; i < pts.size(); i++){
route.push_back(pts[i].getID());
}
route.push_back(pts[0].getID());
vector<int> bestRoute(route);
float traveled_distance = traveledDistance(route);
cout << "The traveled distance is " << traveled_distance << endl;
while(next_permutation(route.begin()+1, route.end()-1)){
float temp = traveledDistance(route);
if( temp < traveled_distance){
traveled_distance = temp;
bestRoute = route;
cout << "The best travel distance for now is: " << traveled_distance << endl;
cout << "The current best route is: ";
for(int i = 0; i < bestRoute.size(); i++){
cout << bestRoute[i] << " ";
}
cout << endl;
}
}
cout << "Results =============================================" << endl;
cout << "The best route is from: ";
for(int i = 0; i < bestRoute.size(); i++){
int id = pts[bestRoute[i]].getID();
cout << id << " ";
}
cout << endl;
cout << "The best travel distance is " << traveled_distance << endl;
}
int main(int argc, char* argv[]){
ReadFile(argv[1]);
cout << "The input points are: " << endl;
for(int i = 0; i < pts.size(); i++){
int x = pts.at(i).getX();
int y = pts.at(i).getY();
int id = pts.at(i).getID();
cout << "Position: " << x << " " << y << " ID: " << id << endl;
}
cout << endl;
clock_t initT;
initT = clock();
BruteForce();
clock_t t = clock() - initT;
double time = (double)t/CLOCKS_PER_SEC;
cout << endl;
cout << "The running time is: " << time << "s" << endl;
}