-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
85 lines (67 loc) · 2.76 KB
/
main.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
#include <iostream>
#include "classes/Dataset.h"
#include "classes/Parser.h"
#include "classes/TSP.h"
#include "classes/Triangular.h"
#include "classes/Heuristic.h"
#include "classes/Menu.h"
int main() {
Menu menu;
menu.DatasetMenu();
menu.MainMenu();
return 0;
}
void testTSPBacktracking(Dataset dataset,std::string path, std::string file);
void testTSPTriangular(Dataset dataset,std::string path ,std::string file);
void testFunctions(Dataset dataset, std::string path ,std::string file);
void printPath(std::vector<int> path,double sumDist);
void testConnecter(Dataset dataset, std::string path, std::string file);
void testConnecter(Dataset dataset, std::string path, std::string file){
Parser parser;
auto start = std::chrono::high_resolution_clock::now();
auto e = parser.readFile(path + file,true);
dataset.loadEdges(e);
auto end = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsed = end - start;
std::cout << "Elapsed time: " << elapsed.count() << " seconds" << std::endl;
Graph g = dataset.getGraph();
bool possible = g.connectGraphThroughDjikstra();
std::cout << "connecting the graph is " << possible << '\n';
}
void testFunctions(Dataset dataset,std::string path, std::string file) {
Parser parser;
auto e = parser.readFile(path + file,true);
dataset.loadEdges(e);
Graph g = dataset.getGraph();
std::pair<double, std::vector<int>> tsp = Heuristic::heuristic(&g);
printPath(tsp.second,tsp.first);
}
void testTSPBacktracking(Dataset dataset,std::string filePath, std::string file) {
Parser parser;
auto e = parser.readFile(filePath + file,true);
dataset.loadEdges(e);
dataset.loadMatrix(e);
double sum = 0;
std::vector<int> path(dataset.getGraph().getNodeSize(),0);
double sumDist = TSP::tspBT(dataset.getAdjMatrix(),dataset.getGraph().getNodeSize(),path);
path.push_back(0);
printPath(path,sumDist);
}
void testTSPTriangular(Dataset dataset,std::string filePath, std::string file) {
Parser parser;
std::vector<int> result;
auto start = std::chrono::high_resolution_clock::now();
auto e = parser.readFile(filePath + file,true);
dataset.loadEdges(e);
auto end = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsed = end - start;
std::cout << "Elapsed time: " << elapsed.count() << " seconds" << std::endl;
start = std::chrono::high_resolution_clock::now();
Graph graph = dataset.getGraph();
graph.makeGraphFullyConnected();
end = std::chrono::high_resolution_clock::now();
elapsed = end - start;
std::cout << "Elapsed time: " << elapsed.count() << " seconds" << std::endl;
double sumDist = Triangular::tspTriangular(graph,result);
printPath(result,sumDist);
}