def test_PP_FI_8(self): for n in range(0, 13): for i in range(0, 10): V, E = randomGNP(n, 0.2) G = Graph(V, E) T, w = tdlib.PP_FI(G) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True)
def test_PP_FI(self): print("---PP_FI---") for i in range(0, COUNT+1): G = Graph(eval(PREFIX+".V_"+str(i)), eval(PREFIX+".E_"+str(i))) base.print_graph_name(PREFIX, i) T, w = tdlib.PP_FI(G) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True)
def test_PP_FI_7(self): G = Graph(V_Grid_5_5, E_Grid_5_5) T, w = tdlib.PP_FI(G) print(str(T.vertices())) print(str(T.edges())) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True) self.assertEqual(w, 5)
def test_PP_FI_6(self): G = Graph(V_Pappus, E_Pappus) T, w = tdlib.PP_FI(G) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True) self.assertEqual(w, 6)
def test_PP_FI_5(self): G = Graph(V_Wagner, E_Wagner) T, w = tdlib.PP_FI(G) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True) self.assertEqual(w, 4)
def test_PP_FI_4(self): G = Graph(V_Petersen_double, E_Petersen_double) T, w = tdlib.PP_FI(G) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True) self.assertEqual(w >= 4 and w <= 5, True) #c++11 issuse
def test_PP_FI_0(self): for V, E in cornercases: G = Graph(V, E) T, w = tdlib.PP_FI(G) self.assertEqual(tdlib.is_valid_treedecomposition(G, T), True)