def test_LB7(self):
print("---LBPC_deltaC---")
for i in range(0, COUNT+1):
if base.skip(PREFIX, i, lambda x,y: x > 300 or y > 300):
continue
base.print_graph_name(PREFIX, i)
G = Graph(eval(PREFIX+".V_"+str(i)), eval(PREFIX+".E_"+str(i)))
tdlib.lower_bound(G, "LBPC_deltaC")
def test_LB7(self):
print("---LBPC_deltaC---")
for i in range(0, COUNT + 1):
if base.skip(PREFIX, i, lambda x, y: x > 300 or y > 300):
continue
base.print_graph_name(PREFIX, i)
G = Graph(eval(PREFIX + ".V_" + str(i)),
eval(PREFIX + ".E_" + str(i)))
tdlib.lower_bound(G, "LBPC_deltaC")
def test_long1(self):
print("---generic search - FILL config---")
for i in range(0, COUNT_NETWORKS+1):
if base.skip(PREFIX_NETWORKS, i, lambda x,y: x > 100 or y > 2000):
continue
base.print_graph_name(PREFIX_NETWORKS, i)
G = Graph(eval(PREFIX_NETWORKS+".V_"+str(i)), eval(PREFIX_NETWORKS+".E_"+str(i)))
tdlib.generic_elimination_search_p17_jumper(G, MAX_NODES, MAX_ORDERINGS)
print("")
def test_max_clique(self):
print("---max_clique---")
for i in range(0, COUNT + 1):
if base.skip(PREFIX, i, lambda x, y: y > 2000):
print("skip.. ")
base.print_graph_name(PREFIX, i)
continue
base.print_graph_name(PREFIX, i)
G = Graph(eval(PREFIX + ".V_" + str(i)),
eval(PREFIX + ".E_" + str(i)))
T, w = tdlib.minDegree_decomp(G)
S = tdlib.max_clique_with_treedecomposition(G, T)
def test_long1(self):
print("---generic search - PACE config---")
for i in range(0, COUNT_DIMACS + 1):
if base.skip(PREFIX_DIMACS, i, lambda x, y: x > 100 or y > 2000):
continue
base.print_graph_name(PREFIX_DIMACS, i)
G = Graph(eval(PREFIX_DIMACS + ".V_" + str(i)),
eval(PREFIX_DIMACS + ".E_" + str(i)))
tdlib.generic_elimination_search_p17_jumper(
G, MAX_NODES, MAX_ORDERINGS)
print("")
def test_min_vertex_cover(self):
print("---vertex_cover---")
for i in range(0, COUNT + 1):
if base.skip(PREFIX, i, lambda x, y: y > 2000):
print("skip.. ")
base.print_graph_name(PREFIX, i)
continue
base.print_graph_name(PREFIX, i)
G = Graph(eval(PREFIX + ".V_" + str(i)),
eval(PREFIX + ".E_" + str(i)))
T, w = tdlib.minDegree_decomp(G)
if w > 17:
print("...tw > 17, skipping...")
continue
S = tdlib.min_vertex_cover_with_treedecomposition(G, T)
def test_min_vertex_cover(self):
print("---vertex_cover---")
for i in range(0, COUNT+1):
if i == 91:
continue
if base.skip(PREFIX, i, lambda x,y: y > 10000):
continue
base.print_graph_name(PREFIX, i)
G = Graph(eval(PREFIX+".V_"+str(i)), eval(PREFIX+".E_"+str(i)))
T, w = tdlib.minDegree_decomp(G)
if w > 25:
print("...tw > 25, skipping...")
continue
S = tdlib.min_vertex_cover_with_treedecomposition(G, T)
print(str(S))
def test_min_dominating_set(self):
print("---dominating_set---")
for i in range(0, COUNT + 1):
if i == 91:
continue
if base.skip(PREFIX, i, lambda x, y: y > 2000):
continue
base.print_graph_name(PREFIX, i)
G = Graph(eval(PREFIX + ".V_" + str(i)),
eval(PREFIX + ".E_" + str(i)))
T, w = tdlib.minDegree_decomp(G)
if w > 8:
print("...tw > 8, skipping...")
continue
S = tdlib.min_dominating_set_with_treedecomposition(G, T)
