def test_c1_c2_tiles(self):
G1 = dnx.chimera_graph(1)
G2 = dnx.chimera_graph(2)
G = common_working_graph(G1, G1)
self.assertEqual(len(G), 8)
def test_sampler_adjacency(self):
adj = {0: {1, 2}, 1: {2}, 2: {0, 1}}
G = dnx.chimera_graph(1)
H = common_working_graph(adj, G)
self.assertEqual(set(H.nodes), {0, 1, 2})
self.assertEqual(set(H.edges), set())
def test_missing_node(self):
G1 = dnx.chimera_graph(1)
G1.remove_node(2)
G2 = dnx.chimera_graph(2)
G = common_working_graph(G1, G1)
self.assertNotIn(2, G)
self.assertNotIn((2, 4), G.edges())
def test_single_tile(self):
G1 = dnx.chimera_graph(1)
G = common_working_graph(G1, G1)
# should have 8 nodes
self.assertEqual(len(G), 8)
# nodes 0,...,7 should be in the tile
for n in range(8):
self.assertIn(n, G)
# check bipartite
for i in range(4):
for j in range(4, 8):
self.assertTrue((i, j) in G.edges() or (j, i) in G.edges())
