def setUp(self):
reader = Reader()
graph_tsp = reader.euclidean('data/in/christofides.tsp')
graph_hpp = reader.euclidean('data/in/christofides.tsp', 1, 39)
mst = Minimum_Spanning_Tree()
graph_tsp = mst.calculate(graph_tsp)
graph_hpp = mst.calculate(graph_hpp)
matcher = Matcher()
self.graph_tsp = matcher.calculate(graph_tsp)
node_s = graph_hpp.node_s
node_t = graph_hpp.node_t
weight = graph_hpp.lookup_distance(node_s, node_t)[0]
if not graph_hpp.contains_edge(node_s, node_t):
edge_st = Edge(node_s, node_t, weight)
graph_hpp.add_edge(edge_st)
self.graph_hpp = matcher.calculate(graph_hpp)
self.euler = Euler()
class Test_MST(unittest.TestCase):
def setUp(self):
self.reader = Reader()
self.mst = Minimum_Spanning_Tree()
def test_length(self):
self.graph = self.reader.euclidean('data/in/eil51.tsp')
graph = self.mst.calculate(self.graph)
length = 0
for edge in graph.edges:
length += edge.weight
self.assertEqual(length, 750)
def setUp(self):
self.reader = Reader()
class Test_Graph(unittest.TestCase):
def setUp(self):
self.reader = Reader()
def test_add_node(self):
graph = self.reader.euclidean("data/in/eil51.tsp")
size_before = graph.size
positions = [999, 999]
node = Node(size_before, positions, "test_node")
graph.add_node(node)
size_after = graph.size
self.assertEqual(size_before, 51)
self.assertEqual(size_after, 52)
def test_add_edge(self):
graph = self.reader.euclidean("data/in/eil51.tsp")
size = graph.size
positions_1 = list = [998, 998]
node_1 = Node(size, positions_1, "test_node_1")
size = graph.size
positions_2 = list = [999, 999]
node_2 = Node(size, positions_2, "test_node_2")
edge = Edge(node_1, node_2, 999)
graph.add_node(node_1)
graph.add_node(node_2)
contains_before = graph.contains_edge(edge.node_1, edge.node_2)
graph.add_edge(edge)
contains_after = graph.contains_edge(edge.node_1, edge.node_2)
self.assertFalse(contains_before)
self.assertTrue(contains_after)
def test_remove_edge(self):
graph = self.reader.euclidean("data/in/eil51.tsp")
nodes = graph.nodes
node_1 = nodes[0]
node_2 = nodes[1]
edge = graph.edge_by_nodes(node_1, node_2)[0]
contains_before = graph.contains_edge(edge.node_1, edge.node_2)
graph.remove_edge(edge)
contains_after = graph.contains_edge(edge.node_1, edge.node_2)
self.assertTrue(contains_before)
self.assertFalse(contains_after)
def test_neighbours_nodes(self):
graph = self.reader.euclidean("data/in/eil51.tsp")
node = graph.nodes[0]
neighbours = graph.neighbour_nodes(node)
neighbours_size = len(neighbours)
neighbour_list = list(neighbours)
neighbour_list = sorted(neighbour_list, key=lambda node: node.nr)
# there have to be 50 neighbours nodes, because it is a complete graph
self.assertEqual(neighbours_size, 50)
node_nr = 1
for neighbour in neighbour_list:
if node.nr == node_nr:
node_nr += 1
next
self.assertEqual(neighbour.nr, node_nr)
node_nr += 1
def test_size(self):
graph = self.reader.euclidean("data/in/eil51.tsp")
size = graph.size
self.assertEqual(size, 51)
def setUp(self):
self.reader = Reader()
self.mst = Minimum_Spanning_Tree()