def test_k_factor2(self):
g = gen.complete_graph(6)
g_kf = reg.k_factor(g, 3)
for edge in g_kf.edges():
assert g.has_edge(edge[0], edge[1])
for _, degree in g_kf.degree():
assert degree == 3
def test_k_factor5(self):
g = gen.complete_graph(6)
# small k to exercise SmallKGadget
g_kf = reg.k_factor(g, 2)
for edge in g_kf.edges():
assert g.has_edge(edge[0], edge[1])
for _, degree in g_kf.degree():
assert degree == 2
def test_is_k_regular2(self):
g = gen.complete_graph(5)
assert reg.is_k_regular(g, 4)
assert not reg.is_k_regular(g, 3)
assert not reg.is_k_regular(g, 6)
def test_is_regular2(self):
g = gen.complete_graph(5)
assert reg.is_regular(g)
def test_complete_graph(self):
g = complete_graph(8)
self.assertIsNone(isomorphism_checker(g))
def setUp(self):
self.atlas_handler = AtlasHandler(mode=mode)
self.g1 = complete_graph(8)
self.g2 = complete_graph(9)
self.g1_name = 'U1'
self.g2_name = 'jack_test_graph'
