def test_simple(self):
graph = UndirectedGraph(5)
graph.add(0, 1, 7)
graph.add(0, 2, 3)
graph.add(0, 3, 2)
graph.add(0, 4, 6)
graph.add(1, 2, 9)
graph.add(1, 3, 4)
graph.add(1, 4, 8)
graph.add(2, 3, 4)
graph.add(2, 4, 5)
graph.add(3, 4, 5)
min_tree_weight, tree_edges = prim(graph)
expected_min_weight = 14
self.assertEqual(expected_min_weight, min_tree_weight)
def test_simple(self):
graph = UndirectedGraph(4)
graph.add(0, 1, 10)
graph.add(0, 2, 4)
graph.add(1, 2, 5)
graph.add(1, 3, 6)
graph.add(2, 3, 5)
value = stoer_wagner(graph)
expected_value = 11 # (0, 1, 2) & 3
self.assertEqual(value, expected_value)
