-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathtesting_main.cpp
142 lines (102 loc) · 3.57 KB
/
testing_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
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
#include <iostream>
#define TESTING
#include "Graph.h"
#include "SimpleEdge.h"
#include <algorithm>
#include <chrono>
/*-----------------------------------------------------------------------------------------------*/
template <class T>
double getExecutionSpeed(T func)
{
using namespace std::chrono;
auto t1 = high_resolution_clock::now();
func();
auto t2 = high_resolution_clock::now();
return duration_cast<duration<double>>(t2 - t1).count();
}
/*-----------------------------------------------------------------------------------------------*/
class GraphTesting {
public:
GraphTesting()
{
// Make some nodes and Edges
Node& rMunich = g.makeNode(Node("Munich"));
Node& rHamburg = g.makeNode<Node>("Hamburg");
Node& rBerlin = g.makeNode<Node>("Berlin");
Node& rFrankfurt = g.makeNode<Node>("Frankfurt");
g.makeEdge<SimpleEdge>(rBerlin, rHamburg, 450);
g.makeEdge<SimpleEdge>(rHamburg, rBerlin, 450);
// You can make the edges bidirectional, too:
g.makeBiEdge<SimpleEdge>(rBerlin, rMunich, 650);
g.makeBiEdge<SimpleEdge>(rBerlin, rFrankfurt, 590);
// find the shortest path
auto path = g.findShortestPathDijkstra(rHamburg, rMunich);
for (Edge* pEdge : path) {
// dynamic_cast to you Edge type is useful, if you have multiple different types of edges.
SimpleEdge* pMyEdge = dynamic_cast<SimpleEdge*>(pEdge);
if (pMyEdge != NULL) {
std::cout << pEdge->toString() << std::endl;
}
}
}
/* TEST: Nodes should be sorted by ID*/
void testNodeOrder()
{
std::cout << "testNodeOrder: ";
if (!std::is_sorted(g.m_nodes.begin(), g.m_nodes.end(),
[](Node* pFirst, Node* pSecond) -> bool {
return pFirst->getId() < pSecond->getId();
}))
{
std::cout << "The Nodes are not sorted correctly!" << std::endl;
return;
}
std::cout << "OK" << std::endl;
}
void testRouting()
{
std::cout << "testRouting: ";
Node* p1 = g.findNodeById("Hamburg");
Node* p2 = g.findNodeById("Frankfurt");
auto path = g.findShortestPathDijkstra(*p1, *p2);
if (path.empty()) {
std::cout << "Shortest Path not found!" << std::endl;
return;
}
std::cout << "OK" << std::endl;
}
void measSearchSpeed() {
std::vector<double> execTimes;
execTimes.push_back(getExecutionSpeed([&]() {
g.findNodeById("Berlin");
}));
execTimes.push_back(getExecutionSpeed([&]() {
g.findNodeById("Hamburg");
}));
execTimes.push_back(getExecutionSpeed([&]() {
g.findNodeById("Konstanz");
}));
execTimes.push_back(getExecutionSpeed([&]() {
g.findNodeById("Munich");
}));
std::cout << "Search times: ";
for (double time : execTimes) {
std::cout << time << "s, ";
}
std::cout << std::endl;
}
private:
Graph g;
};
/*-----------------------------------------------------------------------------------------------*/
int main()
{
GraphTesting gt;
std::cout << "---- Test results: --------------" << std::endl;
gt.testNodeOrder();
gt.testRouting();
std::cout << "---- Time measurements: ---------" << std::endl;
gt.measSearchSpeed();
return 0;
}
/*-----------------------------------------------------------------------------------------------*/