def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
def setUp(self):
# create a graph here
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
self.sights = [(1, 1)]
self.rb = TimedRouteBuilder(self.graph)
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
classifier = VectorAngleRoadClassifier()
self.classified_graph = classifier.apply(self.graph)
class TestTimedRouteBuilder(unittest.TestCase):
def setUp(self):
# create a graph here
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
self.sights = [(1, 1)]
self.rb = TimedRouteBuilder(self.graph)
def test_route_contains_all_sights(self):
route = self.rb.build(60, 120, self.sights)
for sight in self.sights:
self.assertIn(sight, route)
class TestTimedRouteBuilder(unittest.TestCase):
def setUp(self):
# create a graph here
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
self.sights = [(1, 1)]
self.rb = TimedRouteBuilder(self.graph)
def test_route_contains_all_sights(self):
route = self.rb.build(60, 120, self.sights)
for sight in self.sights:
self.assertIn(sight, route)
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
def test_simplify_cycled_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2)])
graph.append_way([(0, 0), (0, 1), (2, 2)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph),
1) # should keep one node with cycle
graph.append_way([(2, 2), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph),
2) # should simplify graph to one segment
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
classifier = VectorAngleRoadClassifier()
self.classified_graph = classifier.apply(self.graph)
def setUp(self):
# create a graph here
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
self.sights = [(1, 1)]
self.rb = TimedRouteBuilder(self.graph)
def test_simplify_cycled_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2)])
graph.append_way([(0, 0), (0, 1), (2, 2)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 1) # should keep one node with cycle
graph.append_way([(2, 2), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should simplify graph to one segment
class TestRoadGraph(unittest.TestCase):
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
def test_edge_is_double_directed(self):
"""
Every edge should be directed in both directions.
"""
for path in self.graph.traverse_paths():
start, finish = path
self.assertIn(start, self.graph[finish])
def test_traverse_two_segment_paths_from_source(self):
"""
Traverse all paths that contain exactly two segments, starting from a given source node.
"""
ipaths = self.graph.traverse_paths(node=(0, 0), length=2)
paths = [path for path in ipaths]
self.assertIn([(0, 0), (0, 1), (0, 2)], paths)
self.assertIn([(0, 0), (1, 1), (1, 2)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2)], paths)
self.assertIn([(0, 0), (1, 1), (2, 2)], paths)
self.assertEqual(len(paths), 4)
def test_traverse_all_two_segment_paths(self):
"""
Traverse all paths in a graph that contain two segments.
"""
ipaths = self.graph.traverse_paths(length=2)
paths = [path for path in ipaths]
self.assertIn([(0, 1), (0, 2), (0, 3)], paths)
self.assertIn([(0, 0), (0, 1), (0, 2)], paths)
self.assertIn([(0, 0), (1, 1), (1, 2)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2)], paths)
self.assertIn([(0, 0), (1, 1), (2, 2)], paths)
self.assertIn([(1, 1), (3, 2), (3, 3)], paths)
self.assertIn([(1, 1), (3, 2), (4, 3)], paths)
self.assertEqual(len(paths), 28)
def test_traverse_all_three_segment_paths(self):
"""
Traverse all paths in a graph that contain three segments.
"""
ipaths = self.graph.traverse_paths(length=3)
paths = [path for path in ipaths] # convert iterator to list
self.assertIn([(0, 0), (0, 1), (0, 2), (0, 3)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2), (3, 3)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2), (4, 3)], paths)
self.assertEqual(len(paths), 30)
def test_traverse_all_one_segment_paths(self):
"""
Traverse all paths that contain one segments, i.e. all paths in a graph that connect two waypoints.
"""
ipaths = self.graph.traverse_paths()
paths = [path for path in ipaths] # convert iterator to list
self.assertIn([(0, 1), (0, 2)], paths)
self.assertIn([(3, 2), (3, 3)], paths)
self.assertIn([(3, 2), (4, 3)], paths)
self.assertIn([(0, 0), (0, 1)], paths)
self.assertIn([(0, 0), (1, 1)], paths)
self.assertIn([(0, 0), (2, 1)], paths)
self.assertIn([(0, 2), (0, 3)], paths)
self.assertIn([(1, 1), (1, 2)], paths)
self.assertIn([(1, 1), (3, 2)], paths)
self.assertIn([(1, 1), (2, 2)], paths)
self.assertEqual(
len(paths), 2 *
10) # double the number because the graph is double-sided directed
# mirror is not useful for double-directed graphs
# @unittest.skip
# def test_mirror(self):
# length = len(self.graph)
# mirrored_graph = self.graph.mirror()
# self.assertEqual(len(self.graph), length) # the original graph has not been modified
# self.assertEqual(len(mirrored_graph), len(self.graph)) # the mirrored graph has the same number of nodes
# for node in mirrored_graph:
# self.assertIn(node, self.graph) # each node from the mirrored graph is in the original graph
# # cardinality of the mirrored node should be equal to the total number of nodes
# # that reference that node in the original graph
# self.assertEqual(len(mirrored_graph[node]),
# sum(1 for n in self.graph if n in self.graph and node in self.graph[n]))
def test_find_next_node(self):
length, last_node, path = self.graph.find_next_node((0, 0), (0, 1))
self.assertEqual(last_node, (0, 3))
self.assertIn((0, 2), path)
self.assertIn((0, 1), path)
length, last_node, path = self.graph.find_next_node((0, 3), (0, 2))
self.assertEqual(last_node, (0, 0))
self.assertIn((0, 2), path)
self.assertIn((0, 1), path)
self.assertNotIn((0, 0), path)
length, last_node, path = self.graph.find_next_node((0, 0), (1, 1))
self.assertEqual(last_node, (1, 1))
self.assertEqual(len(path), 0)
def test_simplify(self):
simplified_graph = self.graph.simplify()
simplified_graph = simplified_graph.simplify()
self.assertEqual(len(simplified_graph), 9)
def test_simplify_one_segment_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph),
2) # should not remove any nodes
def test_simplify_cycled_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2)])
graph.append_way([(0, 0), (0, 1), (2, 2)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph),
1) # should keep one node with cycle
graph.append_way([(2, 2), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph),
2) # should simplify graph to one segment
def test_simplify_graph_with_multiple_directions(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2), (3, 3)])
graph.append_way([(4, 4), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should keep one segment
def test_edges_attribute(self):
edges = self.graph.edges()
self.assertIn([(0, 1), (0, 2)], edges)
self.assertIn([(3, 2), (3, 3)], edges)
self.assertIn([(3, 2), (4, 3)], edges)
self.assertIn([(0, 0), (0, 1)], edges)
self.assertIn([(0, 0), (1, 1)], edges)
self.assertIn([(0, 0), (2, 1)], edges)
self.assertIn([(0, 2), (0, 3)], edges)
self.assertIn([(1, 1), (1, 2)], edges)
self.assertIn([(1, 1), (3, 2)], edges)
self.assertIn([(1, 1), (2, 2)], edges)
self.assertEqual(
len(edges), 2 *
10) # double the number because the graph is double-sided directed
def test_dfs(self):
paths = self.graph.dfs(node=(0, 0), skip_history=3)
allowed_paths = []
allowed_paths.append([(0, 0), (0, 1), (0, 2), (0, 3)])
allowed_paths.append([(0, 0), (1, 1), (1, 2)])
allowed_paths.append([(0, 0), (1, 1), (2, 2)])
allowed_paths.append([(0, 0), (1, 1), (3, 2), (3, 3)])
allowed_paths.append([(0, 0), (1, 1), (3, 2), (4, 3)])
allowed_paths.append([(0, 0), (2, 1)])
for path in paths:
self.assertIn(path, allowed_paths)
def test_simplify_graph_with_multiple_directions(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2), (3, 3)])
graph.append_way([(4, 4), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should keep one segment
def test_simplify_one_segment_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph),
2) # should not remove any nodes
class TestRouteBuilders(unittest.TestCase):
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
classifier = VectorAngleRoadClassifier()
self.classified_graph = classifier.apply(self.graph)
# query = """way(47081339);out;"""
# self.nodes = QueryRoadCollector().get_roads(query)
# self.classes = VectorAngleRoadClassifier().apply(self.nodes)
def test_build_shortest_route(self):
rb = ShortestPathRouteBuilder()
path = rb.build(self.classified_graph, (0, 0), (3, 3))
for waypoint in [(0, 0), (1, 1), (3, 2), (3, 3)]:
self.assertIn(waypoint, path, "Waypoint {} is not in the shortest path".format(waypoint))
def test_shortest_path_is_connected(self):
rb = ShortestPathRouteBuilder()
path = rb.build(self.classified_graph, (0, 0), (3, 3))
for segment in zip(path[:-1], path[1:]):
self.assertTrue(list(segment) in self.graph.edges(),
"Segment {} is not available in the RoadGraph".format(str(segment)))
class TestRouteBuilders(unittest.TestCase):
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
classifier = VectorAngleRoadClassifier()
self.classified_graph = classifier.apply(self.graph)
# query = """way(47081339);out;"""
# self.nodes = QueryRoadCollector().get_roads(query)
# self.classes = VectorAngleRoadClassifier().apply(self.nodes)
def test_build_shortest_route(self):
rb = ShortestPathRouteBuilder()
path = rb.build(self.classified_graph, (0, 0), (3, 3))
for waypoint in [(0, 0), (1, 1), (3, 2), (3, 3)]:
self.assertIn(
waypoint, path,
"Waypoint {} is not in the shortest path".format(waypoint))
def test_shortest_path_is_connected(self):
rb = ShortestPathRouteBuilder()
path = rb.build(self.classified_graph, (0, 0), (3, 3))
for segment in zip(path[:-1], path[1:]):
self.assertTrue(
list(segment) in self.graph.edges(),
"Segment {} is not available in the RoadGraph".format(
str(segment)))
class TestRoadGraph(unittest.TestCase):
def setUp(self):
# init an example graph
self.graph = RoadGraph()
self.graph.append_way([(0, 0), (0, 1), (0, 2), (0, 3)])
self.graph.append_way([(0, 0), (1, 1), (1, 2)])
self.graph.append_way([(1, 1), (2, 2)])
self.graph.append_way([(0, 0), (2, 1)])
self.graph.append_way([(1, 1), (3, 2), (3, 3)])
self.graph.append_way([(3, 2), (4, 3)])
def test_edge_is_double_directed(self):
"""
Every edge should be directed in both directions.
"""
for path in self.graph.traverse_paths():
start, finish = path
self.assertIn(start, self.graph[finish])
def test_traverse_two_segment_paths_from_source(self):
"""
Traverse all paths that contain exactly two segments, starting from a given source node.
"""
ipaths = self.graph.traverse_paths(node=(0, 0), length=2)
paths = [path for path in ipaths]
self.assertIn([(0, 0), (0, 1), (0, 2)], paths)
self.assertIn([(0, 0), (1, 1), (1, 2)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2)], paths)
self.assertIn([(0, 0), (1, 1), (2, 2)], paths)
self.assertEqual(len(paths), 4)
def test_traverse_all_two_segment_paths(self):
"""
Traverse all paths in a graph that contain two segments.
"""
ipaths = self.graph.traverse_paths(length=2)
paths = [path for path in ipaths]
self.assertIn([(0, 1), (0, 2), (0, 3)], paths)
self.assertIn([(0, 0), (0, 1), (0, 2)], paths)
self.assertIn([(0, 0), (1, 1), (1, 2)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2)], paths)
self.assertIn([(0, 0), (1, 1), (2, 2)], paths)
self.assertIn([(1, 1), (3, 2), (3, 3)], paths)
self.assertIn([(1, 1), (3, 2), (4, 3)], paths)
self.assertEqual(len(paths), 28)
def test_traverse_all_three_segment_paths(self):
"""
Traverse all paths in a graph that contain three segments.
"""
ipaths = self.graph.traverse_paths(length=3)
paths = [path for path in ipaths] # convert iterator to list
self.assertIn([(0, 0), (0, 1), (0, 2), (0, 3)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2), (3, 3)], paths)
self.assertIn([(0, 0), (1, 1), (3, 2), (4, 3)], paths)
self.assertEqual(len(paths), 30)
def test_traverse_all_one_segment_paths(self):
"""
Traverse all paths that contain one segments, i.e. all paths in a graph that connect two waypoints.
"""
ipaths = self.graph.traverse_paths()
paths = [path for path in ipaths] # convert iterator to list
self.assertIn([(0, 1), (0, 2)], paths)
self.assertIn([(3, 2), (3, 3)], paths)
self.assertIn([(3, 2), (4, 3)], paths)
self.assertIn([(0, 0), (0, 1)], paths)
self.assertIn([(0, 0), (1, 1)], paths)
self.assertIn([(0, 0), (2, 1)], paths)
self.assertIn([(0, 2), (0, 3)], paths)
self.assertIn([(1, 1), (1, 2)], paths)
self.assertIn([(1, 1), (3, 2)], paths)
self.assertIn([(1, 1), (2, 2)], paths)
self.assertEqual(len(paths), 2*10) # double the number because the graph is double-sided directed
# mirror is not useful for double-directed graphs
# @unittest.skip
# def test_mirror(self):
# length = len(self.graph)
# mirrored_graph = self.graph.mirror()
# self.assertEqual(len(self.graph), length) # the original graph has not been modified
# self.assertEqual(len(mirrored_graph), len(self.graph)) # the mirrored graph has the same number of nodes
# for node in mirrored_graph:
# self.assertIn(node, self.graph) # each node from the mirrored graph is in the original graph
# # cardinality of the mirrored node should be equal to the total number of nodes
# # that reference that node in the original graph
# self.assertEqual(len(mirrored_graph[node]),
# sum(1 for n in self.graph if n in self.graph and node in self.graph[n]))
def test_find_next_node(self):
length, last_node, path = self.graph.find_next_node((0, 0), (0, 1))
self.assertEqual(last_node, (0, 3))
self.assertIn((0, 2), path)
self.assertIn((0, 1), path)
length, last_node, path = self.graph.find_next_node((0, 3), (0, 2))
self.assertEqual(last_node, (0, 0))
self.assertIn((0, 2), path)
self.assertIn((0, 1), path)
self.assertNotIn((0, 0), path)
length, last_node, path = self.graph.find_next_node((0, 0), (1, 1))
self.assertEqual(last_node, (1, 1))
self.assertEqual(len(path), 0)
def test_simplify(self):
simplified_graph = self.graph.simplify()
simplified_graph = simplified_graph.simplify()
self.assertEqual(len(simplified_graph), 9)
def test_simplify_one_segment_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should not remove any nodes
def test_simplify_cycled_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2)])
graph.append_way([(0, 0), (0, 1), (2, 2)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 1) # should keep one node with cycle
graph.append_way([(2, 2), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should simplify graph to one segment
def test_simplify_graph_with_multiple_directions(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2), (3, 3)])
graph.append_way([(4, 4), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should keep one segment
def test_edges_attribute(self):
edges = self.graph.edges()
self.assertIn([(0, 1), (0, 2)], edges)
self.assertIn([(3, 2), (3, 3)], edges)
self.assertIn([(3, 2), (4, 3)], edges)
self.assertIn([(0, 0), (0, 1)], edges)
self.assertIn([(0, 0), (1, 1)], edges)
self.assertIn([(0, 0), (2, 1)], edges)
self.assertIn([(0, 2), (0, 3)], edges)
self.assertIn([(1, 1), (1, 2)], edges)
self.assertIn([(1, 1), (3, 2)], edges)
self.assertIn([(1, 1), (2, 2)], edges)
self.assertEqual(len(edges), 2*10) # double the number because the graph is double-sided directed
def test_dfs(self):
paths = self.graph.dfs(node=(0, 0), skip_history=3)
allowed_paths = []
allowed_paths.append([(0, 0), (0, 1), (0, 2), (0, 3)])
allowed_paths.append([(0, 0), (1, 1), (1, 2)])
allowed_paths.append([(0, 0), (1, 1), (2, 2)])
allowed_paths.append([(0, 0), (1, 1), (3, 2), (3, 3)])
allowed_paths.append([(0, 0), (1, 1), (3, 2), (4, 3)])
allowed_paths.append([(0, 0), (2, 1)])
for path in paths:
self.assertIn(path, allowed_paths)
def test_simplify_graph_with_multiple_directions(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1), (2, 2), (3, 3)])
graph.append_way([(4, 4), (3, 3)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should keep one segment
def test_simplify_one_segment_graph(self):
graph = RoadGraph()
graph.append_way([(0, 0), (1, 1)])
simplified_graph = graph.simplify()
self.assertEqual(len(simplified_graph), 2) # should not remove any nodes