def drawRoadsBetweenCities(self):
contiguous_city_tiles_list = findJoinableCitySets(self)
for list in contiguous_city_tiles_list:
roads_to_draw = graph_tools.getMinimumSpanningTree(list)
for city_pair in roads_to_draw:
tile_list = getClosestRoute(self, city_pair[0], city_pair[1])
for tile in tile_list:
tile.road = "road"
def drawRoadsBetweenCities(self):
contiguous_city_tiles_list = findJoinableCitySets(self)
for list in contiguous_city_tiles_list:
roads_to_draw = graph_tools.getMinimumSpanningTree(list)
for city_pair in roads_to_draw:
tile_list = getClosestRoute(self, city_pair[0], city_pair[1])
for tile in tile_list:
tile.road = "road"
def test_basic_tree(self):
t1 = basic_map.Tile('grass', 1,3)
t2 = basic_map.Tile('grass', 2,10)
t3 = basic_map.Tile('grass', 2,5)
tiles = [t1,t2,t3]
spanning_tree = graph_tools.getMinimumSpanningTree(tiles)
self.assertTrue(hasPairTuple(t1, t3, spanning_tree), str(spanning_tree))
self.assertTrue(hasPairTuple(t2, t3, spanning_tree), str(spanning_tree))
self.assertTrue(not hasPairTuple(t1, t2, spanning_tree), str(spanning_tree))
def test_basic_tree(self):
t1 = basic_map.Tile('grass', 1, 3)
t2 = basic_map.Tile('grass', 2, 10)
t3 = basic_map.Tile('grass', 2, 5)
tiles = [t1, t2, t3]
spanning_tree = graph_tools.getMinimumSpanningTree(tiles)
self.assertTrue(hasPairTuple(t1, t3, spanning_tree),
str(spanning_tree))
self.assertTrue(hasPairTuple(t2, t3, spanning_tree),
str(spanning_tree))
self.assertTrue(not hasPairTuple(t1, t2, spanning_tree),
str(spanning_tree))
def test_large_tree(self):
t1 = basic_map.Tile('grass', 1,3)
t2 = basic_map.Tile('grass', 2,10)
t3 = basic_map.Tile('grass', 2,5)
t4 = basic_map.Tile('grass', 3,15)
t5 = basic_map.Tile('grass', 2.1,20)
t6 = basic_map.Tile('grass', 2.5,35)
tiles = [t1,t2,t3,t4,t5,t6]
spanning_tree = graph_tools.getMinimumSpanningTree(tiles)
self.assertTrue(hasPairTuple(t1, t3, spanning_tree), str(spanning_tree))
self.assertTrue(hasPairTuple(t2, t3, spanning_tree), str(spanning_tree))
self.assertTrue(hasPairTuple(t2, t4, spanning_tree), str(spanning_tree))
self.assertTrue(hasPairTuple(t4, t5, spanning_tree), str(spanning_tree))
self.assertTrue(hasPairTuple(t5, t6, spanning_tree), str(spanning_tree))
self.assertTrue(len(spanning_tree)==5)
def test_large_tree(self):
t1 = basic_map.Tile('grass', 1, 3)
t2 = basic_map.Tile('grass', 2, 10)
t3 = basic_map.Tile('grass', 2, 5)
t4 = basic_map.Tile('grass', 3, 15)
t5 = basic_map.Tile('grass', 2.1, 20)
t6 = basic_map.Tile('grass', 2.5, 35)
tiles = [t1, t2, t3, t4, t5, t6]
spanning_tree = graph_tools.getMinimumSpanningTree(tiles)
self.assertTrue(hasPairTuple(t1, t3, spanning_tree),
str(spanning_tree))
self.assertTrue(hasPairTuple(t2, t3, spanning_tree),
str(spanning_tree))
self.assertTrue(hasPairTuple(t2, t4, spanning_tree),
str(spanning_tree))
self.assertTrue(hasPairTuple(t4, t5, spanning_tree),
str(spanning_tree))
self.assertTrue(hasPairTuple(t5, t6, spanning_tree),
str(spanning_tree))
self.assertTrue(len(spanning_tree) == 5)
