class TestDFSSolver(unittest.TestCase):
def setUp(self):
graph = UndirectedGraph(7)
graph.addEdge(0, 1)
graph.addEdge(1, 2)
graph.addEdge(1, 3)
graph.addEdge(1, 4)
graph.addEdge(4, 5)
graph.addEdge(4, 6)
graph.addEdge(0, 4)
self.solver = DFSSolver(graph)
def test_firstEdgeCandidates(self):
edges = self.solver.firstEdgeCandidates()
self.assertEqual(set([Edge(0, 1), Edge(0, 4)]), set(edges))
def test_backtrackMarker(self):
self.assertTrue(Edge(-1, -1).isBacktrackMarker())
def test_findBestSolutionFor7(self):
solution, price = self.solver.findBestSolution()
self.assertEqual(3, price)
expected = [Edge(0, 1), Edge(1, 2), Edge(1, 3), Edge(0, 4), Edge(4, 5), Edge(4, 6)]
self.assertEqual(set(expected), set(solution.edgeList()))
def test_findBestSolutionFor10(self):
graph = UndirectedGraph(10)
graph.addEdge(0, 4)
graph.addEdge(0, 5)
graph.addEdge(0, 6)
graph.addEdge(0, 8)
graph.addEdge(0, 9)
graph.addEdge(1, 2)
graph.addEdge(1, 3)
graph.addEdge(1, 5)
graph.addEdge(1, 6)
graph.addEdge(1, 7)
graph.addEdge(1, 8)
graph.addEdge(2, 6)
graph.addEdge(2, 7)
graph.addEdge(2, 9)
graph.addEdge(3, 5)
graph.addEdge(3, 6)
graph.addEdge(3, 7)
graph.addEdge(4, 5)
graph.addEdge(4, 6)
graph.addEdge(4, 8)
graph.addEdge(4, 9)
graph.addEdge(5, 9)
graph.addEdge(6, 7)
graph.addEdge(6, 9)
graph.addEdge(7, 8)
solver = DFSSolver(graph)
# self.solver.DEBUG = True
solution, price = solver.findBestSolution()
self.assertEqual(2, price)
expected = [Edge(0, 9), Edge(1, 2), Edge(1, 3), Edge(3, 5), Edge(4, 5), Edge(4, 8), Edge(6, 7), Edge(6, 9), Edge(7, 8)]
self.assertEqual(set(expected), set(solution.edgeList()))
def test_splitStack(self):
self.solver.edge_stack.append(Edge(0, 1))
self.solver.pushBacktrackMarker()
self.solver.edge_stack.append(Edge(0, 1))
self.solver.edge_stack.append(Edge(4, 1))
self.solver.edge_stack.append(Edge(4, 5))
self.solver.pushBacktrackMarker()
self.solver.edge_stack.append(Edge(0, 1))
self.solver.edge_stack.append(Edge(4, 1))
self.solver.edge_stack.append(Edge(4, 5))
self.solver.spanning_tree.addEdge(Edge(0, 4))
self.solver.spanning_tree.addEdge(Edge(4, 6))
print("before split:")
self.solver.printStack()
print(self.solver.spanning_tree)
new_stack, new_sp_tree = self.solver.splitWork()
print("new stack and tree:")
for edge in new_stack:
print(edge)
print("---")
print(new_sp_tree)
print("after split:")
self.solver.printStack()
print(self.solver.spanning_tree)
