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
147
148
|
#include "testing/testing.hpp"
#include "routing/base/astar_algorithm.hpp"
#include "routing/base/astar_graph.hpp"
#include "routing/base/routing_result.hpp"
#include "routing/routing_tests/routing_algorithm.hpp"
#include <cstdint>
#include <map>
#include <utility>
#include <vector>
namespace routing_test
{
using namespace routing;
using namespace std;
using Algorithm = AStarAlgorithm<uint32_t, SimpleEdge, double>;
void TestAStar(UndirectedGraph & graph, vector<unsigned> const & expectedRoute, double const & expectedDistance)
{
Algorithm algo;
Algorithm::ParamsForTests params(graph, 0u /* startVertex */, 4u /* finishVertex */,
nullptr /* prevRoute */, {} /* checkLengthCallback */);
RoutingResult<unsigned /* Vertex */, double /* Weight */> actualRoute;
TEST_EQUAL(Algorithm::Result::OK, algo.FindPath(params, actualRoute), ());
TEST_EQUAL(expectedRoute, actualRoute.m_path, ());
TEST_ALMOST_EQUAL_ULPS(expectedDistance, actualRoute.m_distance, ());
actualRoute.m_path.clear();
TEST_EQUAL(Algorithm::Result::OK, algo.FindPathBidirectional(params, actualRoute), ());
TEST_EQUAL(expectedRoute, actualRoute.m_path, ());
TEST_ALMOST_EQUAL_ULPS(expectedDistance, actualRoute.m_distance, ());
}
UNIT_TEST(AStarAlgorithm_Sample)
{
UndirectedGraph graph;
// Inserts edges in a format: <source, target, weight>.
graph.AddEdge(0, 1, 10);
graph.AddEdge(1, 2, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 4, 10);
graph.AddEdge(3, 4, 3);
vector<unsigned> const expectedRoute = {0, 1, 2, 3, 4};
TestAStar(graph, expectedRoute, 23);
}
UNIT_TEST(AStarAlgorithm_CheckLength)
{
UndirectedGraph graph;
// Inserts edges in a format: <source, target, weight>.
graph.AddEdge(0, 1, 10);
graph.AddEdge(1, 2, 5);
graph.AddEdge(2, 3, 5);
graph.AddEdge(2, 4, 10);
graph.AddEdge(3, 4, 3);
Algorithm algo;
Algorithm::ParamsForTests params(graph, 0u /* startVertex */, 4u /* finishVertex */,
nullptr /* prevRoute */,
[](double weight) { return weight < 23; });
RoutingResult<unsigned /* Vertex */, double /* Weight */> routingResult;
Algorithm::Result result = algo.FindPath(params, routingResult);
// Best route weight is 23 so we expect to find no route with restriction |weight < 23|.
TEST_EQUAL(result, Algorithm::Result::NoPath, ());
routingResult = {};
result = algo.FindPathBidirectional(params, routingResult);
// Best route weight is 23 so we expect to find no route with restriction |weight < 23|.
TEST_EQUAL(result, Algorithm::Result::NoPath, ());
}
UNIT_TEST(AdjustRoute)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
graph.AddEdge(6, 0, 1);
graph.AddEdge(6, 1, 1);
graph.AddEdge(6, 2, 1);
// Each edge contains {vertexId, weight}.
vector<SimpleEdge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
Algorithm algo;
Algorithm::ParamsForTests params(graph, 6 /* startVertex */, {} /* finishVertex */, &prevRoute,
[](double weight) { return weight <= 1.0; });
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto const code = algo.AdjustRoute(params, result);
vector<unsigned> const expectedRoute = {6, 2, 3, 4, 5};
TEST_EQUAL(code, Algorithm::Result::OK, ());
TEST_EQUAL(result.m_path, expectedRoute, ());
TEST_EQUAL(result.m_distance, 4.0, ());
}
UNIT_TEST(AdjustRouteNoPath)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
// Each edge contains {vertexId, weight}.
vector<SimpleEdge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
Algorithm algo;
Algorithm::ParamsForTests params(graph, 6 /* startVertex */, {} /* finishVertex */, &prevRoute,
[](double weight) { return weight <= 1.0; });
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto const code = algo.AdjustRoute(params, result);
TEST_EQUAL(code, Algorithm::Result::NoPath, ());
TEST(result.m_path.empty(), ());
}
UNIT_TEST(AdjustRouteOutOfLimit)
{
UndirectedGraph graph;
for (unsigned int i = 0; i < 5; ++i)
graph.AddEdge(i /* from */, i + 1 /* to */, 1 /* weight */);
graph.AddEdge(6, 2, 2);
// Each edge contains {vertexId, weight}.
vector<SimpleEdge> const prevRoute = {{0, 0}, {1, 1}, {2, 1}, {3, 1}, {4, 1}, {5, 1}};
Algorithm algo;
Algorithm::ParamsForTests params(graph, 6 /* startVertex */, {} /* finishVertex */, &prevRoute,
[](double weight) { return weight <= 1.0; });
RoutingResult<unsigned /* Vertex */, double /* Weight */> result;
auto const code = algo.AdjustRoute(params, result);
TEST_EQUAL(code, Algorithm::Result::NoPath, ());
TEST(result.m_path.empty(), ());
}
} // namespace routing_test
|
