def test_generate_and_parse_graph6(self): for i in list(range(13)) + [31, 47, 62, 63, 64, 72]: g = nx.random_graphs.gnm_random_graph(i, i * i // 4, seed=i) gstr = nx.generate_graph6(g, header=False) assert_equal(len(gstr), ((i-1) * i // 2 + 5) // 6 + (1 if i < 63 else 4)) g2 = nx.parse_graph6(gstr) assert_equal(g2.order(), g.order()) assert_equal(sorted(g2.edges()), sorted(g.edges()))
def test_generate_and_parse_graph6(self): for i in list(range(13)) + [31, 47, 62, 63, 64, 72]: g = nx.random_graphs.gnm_random_graph(i, i * i // 4, seed=i) gstr = nx.generate_graph6(g, header=False) assert_equal(len(gstr), ((i - 1) * i // 2 + 5) // 6 + (1 if i < 63 else 4)) g2 = nx.parse_graph6(gstr) assert_equal(g2.order(), g.order()) assert_edges_equal(g2.edges(), g.edges())
def test_generate_graph6(self): assert_equal(nx.generate_graph6(nx.empty_graph(0)), '>>graph6<<?') assert_equal(nx.generate_graph6(nx.empty_graph(1)), '>>graph6<<@') G1 = nx.complete_graph(4) assert_equal(nx.generate_graph6(G1, header=True), '>>graph6<<C~') assert_equal(nx.generate_graph6(G1, header=False), 'C~') G2 = nx.complete_bipartite_graph(6, 9) assert_equal(nx.generate_graph6(G2, header=False), 'N??F~z{~Fw^_~?~?^_?') # verified by Sage G3 = nx.complete_graph(67) assert_equal(nx.generate_graph6(G3, header=False), '~?@B' + '~' * 368 + 'w')
def test_generate_graph6(self): assert_equal(nx.generate_graph6(nx.empty_graph(0)), '>>graph6<<?') assert_equal(nx.generate_graph6(nx.empty_graph(1)), '>>graph6<<@') G1 = nx.complete_graph(4) assert_equal(nx.generate_graph6(G1, header=True), '>>graph6<<C~') assert_equal(nx.generate_graph6(G1, header=False), 'C~') G2 = nx.complete_bipartite_graph(6,9) assert_equal(nx.generate_graph6(G2, header=False), 'N??F~z{~Fw^_~?~?^_?') # verified by Sage G3 = nx.complete_graph(67) assert_equal(nx.generate_graph6(G3, header=False), '~?@B' + '~' * 368 + 'w')
def directed_raise(self): nx.generate_graph6(nx.DiGraph())
def directed_error(self): nx.generate_graph6(nx.DiGraph())