def test_disjoint(self):
graph = nx.complete_graph(1)
graph.add_node(1)
lb = dnx.minor_min_width(graph)
self.assertEqual(lb, 0)
graph = nx.complete_graph(4)
graph.add_node(4)
lb = dnx.minor_min_width(graph)
self.assertEqual(lb, 3)
graph = nx.complete_graph(4)
graph.add_edge(4, 5)
lb = dnx.minor_min_width(graph)
self.assertEqual(lb, 3)
def test_self_loop(self):
graph = nx.complete_graph(3)
graph.add_edge(0, 0)
graph.add_edge(2, 2)
lb = dnx.minor_min_width(graph)
def test_basic(self):
G = nx.complete_graph(10)
lb = dnx.minor_min_width(G)
self.assertLessEqual(lb, len(G) - 1)
self.assertEqual(len(G), 10)