class Test_heuristic(unittest.TestCase):
def setUp(self):
self.flow = [
[0, 1, 2],
[4, 0, 5],
[7, 2, 0]
]
self.distance = [
[0, 5, 2],
[1, 0, 1],
[6, 2, 0]
]
self.i = Instance(None, self.distance, self.flow)
self.h = Heuristic()
def test_sorted_list_flow(self):
expected = [(2, 0, 7), (1, 2, 5), (1, 0, 4),
(0, 2, 2), (2, 1, 2), (0, 1, 1)]
actual = self.h.sorted_list(self.i.flow, True)
self.assertEqual(actual, expected)
def test_sorted_list_distance(self):
expected = [(1, 0, 1), (1, 2, 1), (0, 2, 2),
(2, 1, 2), (0, 1, 5), (2, 0, 6)]
actual = self.h.sorted_list(self.i.distance, False)
self.assertEqual(actual, expected)
def test_unique_rows_columns_flow(self):
expected = [2, 0, 1]
actual = self.h.unique_rows_columns(
self.h.sorted_list(self.i.flow, True))
self.h.append_unpaired(actual, len(self.i.flow))
self.assertEqual(actual, expected)
def test_unique_rows_columns_distance(self):
expected = [1, 0, 2]
actual = self.h.unique_rows_columns(
self.h.sorted_list(self.i.distance, False))
self.h.append_unpaired(actual, len(self.i.distance))
self.assertEqual(actual, expected)
def test_heuristic_solution(self):
expected = Solution((0, 2, 1))
actual = self.h.solve(self.i)
self.assertTupleEqual(actual.sequence, expected.sequence)
