okstra 0.114.0 → 0.116.0

package/runtime/python/okstra_vendor/networkx/readwrite/tests/test_graph6.py

@@ -1,181 +0,0 @@
-from io import BytesIO
-
-import pytest
-
-import networkx as nx
-import networkx.readwrite.graph6 as g6
-from networkx.utils import edges_equal, nodes_equal
-
-
-def test_from_graph6_invariant_to_trailing_newline():
-    """See gh-7557"""
-    G = nx.from_graph6_bytes(b">>graph6<<P~~~~~~~~~~~~~~~~~~~~~~{\n")
-    H = nx.from_graph6_bytes(b">>graph6<<P~~~~~~~~~~~~~~~~~~~~~~{")
-    assert nx.utils.graphs_equal(G, H)
-
-
-def test_from_graph6_raises_header_newline():
-    """graph6 headers must not be followed by a newline. See gh-7557."""
-    with pytest.raises(nx.NetworkXError):
-        G = nx.from_graph6_bytes(b">>graph6<<\nP~~~~~~~~~~~~~~~~~~~~~~{")
-
-
-class TestGraph6Utils:
-    def test_n_data_n_conversion(self):
-        for i in [0, 1, 42, 62, 63, 64, 258047, 258048, 7744773, 68719476735]:
-            assert g6.data_to_n(g6.n_to_data(i))[0] == i
-            assert g6.data_to_n(g6.n_to_data(i))[1] == []
-            assert g6.data_to_n(g6.n_to_data(i) + [42, 43])[1] == [42, 43]
-
-
-class TestFromGraph6Bytes:
-    def test_from_graph6_bytes(self):
-        data = b"DF{"
-        G = nx.from_graph6_bytes(data)
-        assert nodes_equal(G.nodes(), [0, 1, 2, 3, 4])
-        assert edges_equal(
-            G.edges(), [(0, 3), (0, 4), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)]
-        )
-
-    def test_read_equals_from_bytes(self):
-        data = b"DF{"
-        G = nx.from_graph6_bytes(data)
-        fh = BytesIO(data)
-        Gin = nx.read_graph6(fh)
-        assert nodes_equal(G.nodes(), Gin.nodes())
-        assert edges_equal(G.edges(), Gin.edges())
-
-
-class TestReadGraph6:
-    def test_read_many_graph6(self):
-        """Test for reading many graphs from a file into a list."""
-        data = b"DF{\nD`{\nDqK\nD~{\n"
-        fh = BytesIO(data)
-        glist = nx.read_graph6(fh)
-        assert len(glist) == 4
-        for G in glist:
-            assert sorted(G) == list(range(5))
-
-
-class TestWriteGraph6:
-    """Unit tests for writing a graph to a file in graph6 format."""
-
-    def test_null_graph(self):
-        result = BytesIO()
-        nx.write_graph6(nx.null_graph(), result)
-        assert result.getvalue() == b">>graph6<<?\n"
-
-    def test_trivial_graph(self):
-        result = BytesIO()
-        nx.write_graph6(nx.trivial_graph(), result)
-        assert result.getvalue() == b">>graph6<<@\n"
-
-    def test_complete_graph(self):
-        result = BytesIO()
-        nx.write_graph6(nx.complete_graph(4), result)
-        assert result.getvalue() == b">>graph6<<C~\n"
-
-    def test_large_complete_graph(self):
-        result = BytesIO()
-        nx.write_graph6(nx.complete_graph(67), result, header=False)
-        assert result.getvalue() == b"~?@B" + b"~" * 368 + b"w\n"
-
-    def test_no_header(self):
-        result = BytesIO()
-        nx.write_graph6(nx.complete_graph(4), result, header=False)
-        assert result.getvalue() == b"C~\n"
-
-    def test_complete_bipartite_graph(self):
-        result = BytesIO()
-        G = nx.complete_bipartite_graph(6, 9)
-        nx.write_graph6(G, result, header=False)
-        # The expected encoding here was verified by Sage.
-        assert result.getvalue() == b"N??F~z{~Fw^_~?~?^_?\n"
-
-    @pytest.mark.parametrize("G", (nx.MultiGraph(), nx.DiGraph()))
-    def test_no_directed_or_multi_graphs(self, G):
-        with pytest.raises(nx.NetworkXNotImplemented):
-            nx.write_graph6(G, BytesIO())
-
-    def test_length(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 = BytesIO()
-            nx.write_graph6(g, gstr, header=False)
-            # Strip the trailing newline.
-            gstr = gstr.getvalue().rstrip()
-            assert len(gstr) == ((i - 1) * i // 2 + 5) // 6 + (1 if i < 63 else 4)
-
-    def test_roundtrip(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)
-            f = BytesIO()
-            nx.write_graph6(G, f)
-            f.seek(0)
-            H = nx.read_graph6(f)
-            assert nodes_equal(G.nodes(), H.nodes())
-            assert edges_equal(G.edges(), H.edges())
-
-    def test_write_path(self, tmp_path):
-        with open(tmp_path / "test.g6", "w+b") as f:
-            g6.write_graph6_file(nx.null_graph(), f)
-            f.seek(0)
-            assert f.read() == b">>graph6<<?\n"
-
-    @pytest.mark.parametrize("edge", ((0, 1), (1, 2), (1, 42)))
-    def test_relabeling(self, edge):
-        G = nx.Graph([edge])
-        f = BytesIO()
-        nx.write_graph6(G, f)
-        f.seek(0)
-        assert f.read() == b">>graph6<<A_\n"
-
-
-class TestToGraph6Bytes:
-    def test_null_graph(self):
-        G = nx.null_graph()
-        assert g6.to_graph6_bytes(G) == b">>graph6<<?\n"
-
-    def test_trivial_graph(self):
-        G = nx.trivial_graph()
-        assert g6.to_graph6_bytes(G) == b">>graph6<<@\n"
-
-    def test_complete_graph(self):
-        assert g6.to_graph6_bytes(nx.complete_graph(4)) == b">>graph6<<C~\n"
-
-    def test_large_complete_graph(self):
-        G = nx.complete_graph(67)
-        assert g6.to_graph6_bytes(G, header=False) == b"~?@B" + b"~" * 368 + b"w\n"
-
-    def test_no_header(self):
-        G = nx.complete_graph(4)
-        assert g6.to_graph6_bytes(G, header=False) == b"C~\n"
-
-    def test_complete_bipartite_graph(self):
-        G = nx.complete_bipartite_graph(6, 9)
-        assert g6.to_graph6_bytes(G, header=False) == b"N??F~z{~Fw^_~?~?^_?\n"
-
-    @pytest.mark.parametrize("G", (nx.MultiGraph(), nx.DiGraph()))
-    def test_no_directed_or_multi_graphs(self, G):
-        with pytest.raises(nx.NetworkXNotImplemented):
-            g6.to_graph6_bytes(G)
-
-    def test_length(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)
-            # Strip the trailing newline.
-            gstr = g6.to_graph6_bytes(G, header=False).rstrip()
-            assert len(gstr) == ((i - 1) * i // 2 + 5) // 6 + (1 if i < 63 else 4)
-
-    def test_roundtrip(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)
-            data = g6.to_graph6_bytes(G)
-            H = nx.from_graph6_bytes(data.rstrip())
-            assert nodes_equal(G.nodes(), H.nodes())
-            assert edges_equal(G.edges(), H.edges())
-
-    @pytest.mark.parametrize("edge", ((0, 1), (1, 2), (1, 42)))
-    def test_relabeling(self, edge):
-        G = nx.Graph([edge])
-        assert g6.to_graph6_bytes(G) == b">>graph6<<A_\n"