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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
#include "Graph/Path.h"
#include "Graph/ConstrainedBidiBFSVisitor.h"
#include "Graph/BidirectionalBFS.h"
#include <boost/graph/adjacency_list.hpp>
#include <boost/property_map/property_map.hpp>
#include <limits>
#include <gtest/gtest.h>
using namespace std;
using namespace boost;
typedef adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> Graph;
typedef graph_traits<Graph>::vertex_descriptor V;
typedef graph_traits<Graph>::edge_descriptor e;
typedef std::vector< Path<V> > PathList;
static const size_t NO_MEM_LIMIT = std::numeric_limits<std::size_t>::max();
namespace {
class ConstrainedBidiBFSVisitorTest : public ::testing::Test {
protected:
Graph simpleAcyclicGraph;
Graph simpleCyclicGraph;
Graph cyclicGraph;
ConstrainedBidiBFSVisitorTest() {
add_edge(0, 1, simpleAcyclicGraph);
add_edge(0, 2, simpleAcyclicGraph);
add_edge(2, 3, simpleAcyclicGraph);
add_edge(0, 1, simpleCyclicGraph);
add_edge(1, 3, simpleCyclicGraph);
add_edge(0, 2, simpleCyclicGraph);
add_edge(2, 3, simpleCyclicGraph);
add_edge(0, 1, cyclicGraph);
add_edge(1, 2, cyclicGraph);
add_edge(1, 3, cyclicGraph);
add_edge(2, 3, cyclicGraph);
add_edge(3, 4, cyclicGraph);
add_edge(3, 5, cyclicGraph);
add_edge(4, 5, cyclicGraph);
add_edge(5, 6, cyclicGraph);
}
};
TEST_F(ConstrainedBidiBFSVisitorTest, IdentifyUniquePath)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleAcyclicGraph, 0, 3, 1, 1, 3, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleAcyclicGraph, 0, 3, visitor);
Path<V> uniquePath;
PathSearchResult result = visitor.uniquePathToGoal(uniquePath);
ASSERT_EQ(FOUND_PATH, result);
ASSERT_EQ("0,2,3", uniquePath.str());
}
TEST_F(ConstrainedBidiBFSVisitorTest, StartEqualsGoal)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleAcyclicGraph, 0, 0, 1, 1, 1, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleAcyclicGraph, 0, 0, visitor);
Path<V> uniquePath;
PathSearchResult result = visitor.uniquePathToGoal(uniquePath);
ASSERT_EQ(FOUND_PATH, result);
ASSERT_EQ("0", uniquePath.str());
}
TEST_F(ConstrainedBidiBFSVisitorTest, SingleEdgeToGoal)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleAcyclicGraph, 0, 1, 1, 1, 2, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleAcyclicGraph, 0, 1, visitor);
Path<V> uniquePath;
PathSearchResult result = visitor.uniquePathToGoal(uniquePath);
ASSERT_EQ(FOUND_PATH, result);
ASSERT_EQ("0,1", uniquePath.str());
}
TEST_F(ConstrainedBidiBFSVisitorTest, RespectMaxPathLength)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(cyclicGraph, 0, 6, 4, 5, 6, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(cyclicGraph, 0, 6, visitor);
vector< Path<V> > paths;
PathSearchResult result = visitor.pathsToGoal(paths);
// We expect the fourth path ("0,1,2,3,4,5,6")
// to be excluded by the max path length limit (6).
set<string> expectedPaths;
expectedPaths.insert("0,1,3,5,6");
expectedPaths.insert("0,1,2,3,5,6");
expectedPaths.insert("0,1,3,4,5,6");
EXPECT_EQ(FOUND_PATH, result);
ASSERT_EQ(3u, paths.size());
// check that each path is one of the expected ones
for (unsigned i = 0; i < 3; i++)
ASSERT_TRUE(expectedPaths.find(paths[i].str()) != expectedPaths.end());
// check that each path is unique
for (unsigned i = 0; i < 2; i++)
ASSERT_TRUE(paths[i].str() != paths[i+1].str());
}
TEST_F(ConstrainedBidiBFSVisitorTest, RespectMinPathLength)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(cyclicGraph, 0, 6, 4, 6, 7, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(cyclicGraph, 0, 6, visitor);
vector< Path<V> > paths;
PathSearchResult result = visitor.pathsToGoal(paths);
// We expect the first path ("0,1,3,5,6")
// to be excluded by the min path length limit (6).
set<string> expectedPaths;
expectedPaths.insert("0,1,2,3,5,6");
expectedPaths.insert("0,1,3,4,5,6");
expectedPaths.insert("0,1,2,3,4,5,6");
EXPECT_EQ(FOUND_PATH, result);
ASSERT_EQ(3u, paths.size());
// check that each path is one of the expected ones
for (unsigned i = 0; i < 3; i++)
ASSERT_TRUE(expectedPaths.find(paths[i].str()) != expectedPaths.end());
// check that each path is unique
for (unsigned i = 0; i < 2; i++)
ASSERT_TRUE(paths[i].str() != paths[i+1].str());
}
TEST_F(ConstrainedBidiBFSVisitorTest, RespectMaxPathsLimit)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleCyclicGraph, 0, 3, 1, 1, 3, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleCyclicGraph, 0, 3, visitor);
Path<V> uniquePath;
EXPECT_EQ(visitor.uniquePathToGoal(uniquePath), TOO_MANY_PATHS);
}
TEST_F(ConstrainedBidiBFSVisitorTest, ReturnMultiplePaths)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleCyclicGraph, 0, 3, 2, 1, 3, 2, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleCyclicGraph, 0, 3, visitor);
PathList paths;
PathSearchResult result = visitor.pathsToGoal(paths);
EXPECT_EQ(FOUND_PATH, result);
ASSERT_EQ(2u, paths.size());
string path1 = paths[0].str();
string path2 = paths[1].str();
EXPECT_TRUE(path1 != path2);
ASSERT_TRUE(path1 == "0,1,3" || path1 == "0,2,3");
ASSERT_TRUE(path2 == "0,1,3" || path2 == "0,2,3");
}
TEST_F(ConstrainedBidiBFSVisitorTest, RespectMaxBranches)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleCyclicGraph, 0, 3, 2, 1, 3, 1, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleCyclicGraph, 0, 3, visitor);
PathList paths;
PathSearchResult result = visitor.pathsToGoal(paths);
EXPECT_EQ(TOO_MANY_BRANCHES, result);
EXPECT_EQ(0u, paths.size());
// expect early exit from traversal
EXPECT_EQ(3u, visitor.getNumNodesVisited());
}
TEST_F(ConstrainedBidiBFSVisitorTest, NoLimitForBranches)
{
ConstrainedBidiBFSVisitor<Graph>
visitor(simpleCyclicGraph, 0, 3, 2, 1, 3, NO_LIMIT, NO_LIMIT, NO_MEM_LIMIT);
bidirectionalBFS(simpleCyclicGraph, 0, 3, visitor);
PathList paths;
PathSearchResult result = visitor.pathsToGoal(paths);
EXPECT_EQ(FOUND_PATH, result);
ASSERT_EQ(2u, paths.size());
string path1 = paths[0].str();
string path2 = paths[1].str();
EXPECT_TRUE(path1 != path2);
ASSERT_TRUE(path1 == "0,1,3" || path1 == "0,2,3");
ASSERT_TRUE(path2 == "0,1,3" || path2 == "0,2,3");
}
}
|
