okstra 0.113.0 → 0.115.0

package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_cluster.py

@@ -1,84 +0,0 @@
-import pytest
-
-import networkx as nx
-from networkx.algorithms import bipartite
-from networkx.algorithms.bipartite.cluster import cc_dot, cc_max, cc_min
-
-
-def test_pairwise_bipartite_cc_functions():
-    # Test functions for different kinds of bipartite clustering coefficients
-    # between pairs of nodes using 3 example graphs from figure 5 p. 40
-    # Latapy et al (2008)
-    G1 = nx.Graph([(0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (1, 5), (1, 6), (1, 7)])
-    G2 = nx.Graph([(0, 2), (0, 3), (0, 4), (1, 3), (1, 4), (1, 5)])
-    G3 = nx.Graph(
-        [(0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9)]
-    )
-    result = {
-        0: [1 / 3.0, 2 / 3.0, 2 / 5.0],
-        1: [1 / 2.0, 2 / 3.0, 2 / 3.0],
-        2: [2 / 8.0, 2 / 5.0, 2 / 5.0],
-    }
-    for i, G in enumerate([G1, G2, G3]):
-        assert bipartite.is_bipartite(G)
-        assert cc_dot(set(G[0]), set(G[1])) == result[i][0]
-        assert cc_min(set(G[0]), set(G[1])) == result[i][1]
-        assert cc_max(set(G[0]), set(G[1])) == result[i][2]
-
-
-def test_star_graph():
-    G = nx.star_graph(3)
-    # all modes are the same
-    answer = {0: 0, 1: 1, 2: 1, 3: 1}
-    assert bipartite.clustering(G, mode="dot") == answer
-    assert bipartite.clustering(G, mode="min") == answer
-    assert bipartite.clustering(G, mode="max") == answer
-
-
-def test_not_bipartite():
-    with pytest.raises(nx.NetworkXError):
-        bipartite.clustering(nx.complete_graph(4))
-
-
-def test_bad_mode():
-    with pytest.raises(nx.NetworkXError):
-        bipartite.clustering(nx.path_graph(4), mode="foo")
-
-
-def test_path_graph():
-    G = nx.path_graph(4)
-    answer = {0: 0.5, 1: 0.5, 2: 0.5, 3: 0.5}
-    assert bipartite.clustering(G, mode="dot") == answer
-    assert bipartite.clustering(G, mode="max") == answer
-    answer = {0: 1, 1: 1, 2: 1, 3: 1}
-    assert bipartite.clustering(G, mode="min") == answer
-
-
-def test_average_path_graph():
-    G = nx.path_graph(4)
-    assert bipartite.average_clustering(G, mode="dot") == 0.5
-    assert bipartite.average_clustering(G, mode="max") == 0.5
-    assert bipartite.average_clustering(G, mode="min") == 1
-
-
-def test_ra_clustering_davis():
-    G = nx.davis_southern_women_graph()
-    cc4 = round(bipartite.robins_alexander_clustering(G), 3)
-    assert cc4 == 0.468
-
-
-def test_ra_clustering_square():
-    G = nx.path_graph(4)
-    G.add_edge(0, 3)
-    assert bipartite.robins_alexander_clustering(G) == 1.0
-
-
-def test_ra_clustering_zero():
-    G = nx.Graph()
-    assert bipartite.robins_alexander_clustering(G) == 0
-    G.add_nodes_from(range(4))
-    assert bipartite.robins_alexander_clustering(G) == 0
-    G.add_edges_from([(0, 1), (2, 3), (3, 4)])
-    assert bipartite.robins_alexander_clustering(G) == 0
-    G.add_edge(1, 2)
-    assert bipartite.robins_alexander_clustering(G) == 0

package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_covering.py

@@ -1,33 +0,0 @@
-import networkx as nx
-from networkx.algorithms import bipartite
-
-
-class TestMinEdgeCover:
-    """Tests for :func:`networkx.algorithms.bipartite.min_edge_cover`"""
-
-    def test_empty_graph(self):
-        G = nx.Graph()
-        assert bipartite.min_edge_cover(G) == set()
-
-    def test_graph_single_edge(self):
-        G = nx.Graph()
-        G.add_edge(0, 1)
-        assert bipartite.min_edge_cover(G) == {(0, 1), (1, 0)}
-
-    def test_bipartite_default(self):
-        G = nx.Graph()
-        G.add_nodes_from([1, 2, 3, 4], bipartite=0)
-        G.add_nodes_from(["a", "b", "c"], bipartite=1)
-        G.add_edges_from([(1, "a"), (1, "b"), (2, "b"), (2, "c"), (3, "c"), (4, "a")])
-        min_cover = bipartite.min_edge_cover(G)
-        assert nx.is_edge_cover(G, min_cover)
-        assert len(min_cover) == 8
-
-    def test_bipartite_explicit(self):
-        G = nx.Graph()
-        G.add_nodes_from([1, 2, 3, 4], bipartite=0)
-        G.add_nodes_from(["a", "b", "c"], bipartite=1)
-        G.add_edges_from([(1, "a"), (1, "b"), (2, "b"), (2, "c"), (3, "c"), (4, "a")])
-        min_cover = bipartite.min_edge_cover(G, bipartite.eppstein_matching)
-        assert nx.is_edge_cover(G, min_cover)
-        assert len(min_cover) == 8

package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_edgelist.py

@@ -1,240 +0,0 @@
-"""
-Unit tests for bipartite edgelists.
-"""
-
-import io
-
-import pytest
-
-import networkx as nx
-from networkx.algorithms import bipartite
-from networkx.utils import edges_equal, graphs_equal, nodes_equal
-
-
-class TestEdgelist:
-    @classmethod
-    def setup_class(cls):
-        cls.G = nx.Graph(name="test")
-        e = [("a", "b"), ("b", "c"), ("c", "d"), ("d", "e"), ("e", "f"), ("a", "f")]
-        cls.G.add_edges_from(e)
-        cls.G.add_nodes_from(["a", "c", "e"], bipartite=0)
-        cls.G.add_nodes_from(["b", "d", "f"], bipartite=1)
-        cls.G.add_node("g", bipartite=0)
-        cls.DG = nx.DiGraph(cls.G)
-        cls.MG = nx.MultiGraph()
-        cls.MG.add_edges_from([(1, 2), (1, 2), (1, 2)])
-        cls.MG.add_node(1, bipartite=0)
-        cls.MG.add_node(2, bipartite=1)
-
-    def test_read_edgelist_1(self):
-        s = b"""\
-# comment line
-1 2
-# comment line
-2 3
-"""
-        bytesIO = io.BytesIO(s)
-        G = bipartite.read_edgelist(bytesIO, nodetype=int)
-        assert edges_equal(G.edges(), [(1, 2), (2, 3)])
-
-    def test_read_edgelist_3(self):
-        s = b"""\
-# comment line
-1 2 {'weight':2.0}
-# comment line
-2 3 {'weight':3.0}
-"""
-        bytesIO = io.BytesIO(s)
-        G = bipartite.read_edgelist(bytesIO, nodetype=int, data=False)
-        assert edges_equal(G.edges(), [(1, 2), (2, 3)])
-
-        bytesIO = io.BytesIO(s)
-        G = bipartite.read_edgelist(bytesIO, nodetype=int, data=True)
-        assert edges_equal(
-            G.edges(data=True), [(1, 2, {"weight": 2.0}), (2, 3, {"weight": 3.0})]
-        )
-
-    def test_write_edgelist_1(self):
-        fh = io.BytesIO()
-        G = nx.Graph()
-        G.add_edges_from([(1, 2), (2, 3)])
-        G.add_node(1, bipartite=0)
-        G.add_node(2, bipartite=1)
-        G.add_node(3, bipartite=0)
-        bipartite.write_edgelist(G, fh, data=False)
-        fh.seek(0)
-        assert fh.read() == b"1 2\n3 2\n"
-
-    def test_write_edgelist_2(self):
-        fh = io.BytesIO()
-        G = nx.Graph()
-        G.add_edges_from([(1, 2), (2, 3)])
-        G.add_node(1, bipartite=0)
-        G.add_node(2, bipartite=1)
-        G.add_node(3, bipartite=0)
-        bipartite.write_edgelist(G, fh, data=True)
-        fh.seek(0)
-        assert fh.read() == b"1 2 {}\n3 2 {}\n"
-
-    def test_write_edgelist_3(self):
-        fh = io.BytesIO()
-        G = nx.Graph()
-        G.add_edge(1, 2, weight=2.0)
-        G.add_edge(2, 3, weight=3.0)
-        G.add_node(1, bipartite=0)
-        G.add_node(2, bipartite=1)
-        G.add_node(3, bipartite=0)
-        bipartite.write_edgelist(G, fh, data=True)
-        fh.seek(0)
-        assert fh.read() == b"1 2 {'weight': 2.0}\n3 2 {'weight': 3.0}\n"
-
-    def test_write_edgelist_4(self):
-        fh = io.BytesIO()
-        G = nx.Graph()
-        G.add_edge(1, 2, weight=2.0)
-        G.add_edge(2, 3, weight=3.0)
-        G.add_node(1, bipartite=0)
-        G.add_node(2, bipartite=1)
-        G.add_node(3, bipartite=0)
-        bipartite.write_edgelist(G, fh, data=[("weight")])
-        fh.seek(0)
-        assert fh.read() == b"1 2 2.0\n3 2 3.0\n"
-
-    def test_unicode(self, tmp_path):
-        G = nx.Graph()
-        name1 = chr(2344) + chr(123) + chr(6543)
-        name2 = chr(5543) + chr(1543) + chr(324)
-        G.add_edge(name1, "Radiohead", **{name2: 3})
-        G.add_node(name1, bipartite=0)
-        G.add_node("Radiohead", bipartite=1)
-
-        fname = tmp_path / "edgelist.txt"
-        bipartite.write_edgelist(G, fname)
-        H = bipartite.read_edgelist(fname)
-        assert graphs_equal(G, H)
-
-    def test_latin1_issue(self, tmp_path):
-        G = nx.Graph()
-        name1 = chr(2344) + chr(123) + chr(6543)
-        name2 = chr(5543) + chr(1543) + chr(324)
-        G.add_edge(name1, "Radiohead", **{name2: 3})
-        G.add_node(name1, bipartite=0)
-        G.add_node("Radiohead", bipartite=1)
-
-        fname = tmp_path / "edgelist.txt"
-        with pytest.raises(UnicodeEncodeError):
-            bipartite.write_edgelist(G, fname, encoding="latin-1")
-
-    def test_latin1(self, tmp_path):
-        G = nx.Graph()
-        name1 = "Bj" + chr(246) + "rk"
-        name2 = chr(220) + "ber"
-        G.add_edge(name1, "Radiohead", **{name2: 3})
-        G.add_node(name1, bipartite=0)
-        G.add_node("Radiohead", bipartite=1)
-
-        fname = tmp_path / "edgelist.txt"
-        bipartite.write_edgelist(G, fname, encoding="latin-1")
-        H = bipartite.read_edgelist(fname, encoding="latin-1")
-        assert graphs_equal(G, H)
-
-    def test_edgelist_graph(self, tmp_path):
-        G = self.G
-        fname = tmp_path / "edgelist.txt"
-        bipartite.write_edgelist(G, fname)
-        H = bipartite.read_edgelist(fname)
-        H2 = bipartite.read_edgelist(fname)
-        assert H is not H2  # they should be different graphs
-        G.remove_node("g")  # isolated nodes are not written in edgelist
-        assert nodes_equal(list(H), list(G))
-        assert edges_equal(list(H.edges()), list(G.edges()))
-
-    def test_edgelist_integers(self, tmp_path):
-        G = nx.convert_node_labels_to_integers(self.G)
-        fname = tmp_path / "edgelist.txt"
-        bipartite.write_edgelist(G, fname)
-        H = bipartite.read_edgelist(fname, nodetype=int)
-        # isolated nodes are not written in edgelist
-        G.remove_nodes_from(list(nx.isolates(G)))
-        assert nodes_equal(list(H), list(G))
-        assert edges_equal(list(H.edges()), list(G.edges()))
-
-    def test_edgelist_multigraph(self, tmp_path):
-        G = self.MG
-        fname = tmp_path / "edgelist.txt"
-        bipartite.write_edgelist(G, fname)
-        H = bipartite.read_edgelist(fname, nodetype=int, create_using=nx.MultiGraph())
-        H2 = bipartite.read_edgelist(fname, nodetype=int, create_using=nx.MultiGraph())
-        assert H is not H2  # they should be different graphs
-        assert nodes_equal(list(H), list(G))
-        assert edges_equal(list(H.edges()), list(G.edges()))
-
-    def test_empty_digraph(self):
-        with pytest.raises(nx.NetworkXNotImplemented):
-            bytesIO = io.BytesIO()
-            bipartite.write_edgelist(nx.DiGraph(), bytesIO)
-
-    def test_raise_attribute(self):
-        with pytest.raises(AttributeError):
-            G = nx.path_graph(4)
-            bytesIO = io.BytesIO()
-            bipartite.write_edgelist(G, bytesIO)
-
-    def test_parse_edgelist(self):
-        """Tests for conditions specific to
-        parse_edge_list method"""
-
-        # ignore strings of length less than 2
-        lines = ["1 2", "2 3", "3 1", "4", " "]
-        G = bipartite.parse_edgelist(lines, nodetype=int)
-        assert list(G.nodes) == [1, 2, 3]
-
-        # Exception raised when node is not convertible
-        # to specified data type
-        with pytest.raises(TypeError, match=".*Failed to convert nodes"):
-            lines = ["a b", "b c", "c a"]
-            G = bipartite.parse_edgelist(lines, nodetype=int)
-
-        # Exception raised when format of data is not
-        # convertible to dictionary object
-        with pytest.raises(TypeError, match=".*Failed to convert edge data"):
-            lines = ["1 2 3", "2 3 4", "3 1 2"]
-            G = bipartite.parse_edgelist(lines, nodetype=int)
-
-        # Exception raised when edge data and data
-        # keys are not of same length
-        with pytest.raises(IndexError):
-            lines = ["1 2 3 4", "2 3 4"]
-            G = bipartite.parse_edgelist(
-                lines, nodetype=int, data=[("weight", int), ("key", int)]
-            )
-
-        # Exception raised when edge data is not
-        # convertible to specified data type
-        with pytest.raises(TypeError, match=".*Failed to convert key data"):
-            lines = ["1 2 3 a", "2 3 4 b"]
-            G = bipartite.parse_edgelist(
-                lines, nodetype=int, data=[("weight", int), ("key", int)]
-            )
-
-
-def test_bipartite_edgelist_consistent_strip_handling():
-    """See gh-7462
-
-    Input when printed looks like:
-
-        A       B       interaction     2
-        B       C       interaction     4
-        C       A       interaction
-
-    Note the trailing \\t in the last line, which indicates the existence of
-    an empty data field.
-    """
-    lines = io.StringIO(
-        "A\tB\tinteraction\t2\nB\tC\tinteraction\t4\nC\tA\tinteraction\t"
-    )
-    descr = [("type", str), ("weight", str)]
-    # Should not raise
-    G = nx.bipartite.parse_edgelist(lines, delimiter="\t", data=descr)
-    expected = [("A", "B", "2"), ("A", "C", ""), ("B", "C", "4")]
-    assert sorted(G.edges(data="weight")) == expected

package/runtime/python/okstra_vendor/networkx/algorithms/bipartite/tests/test_extendability.py

@@ -1,334 +0,0 @@
-import pytest
-
-import networkx as nx
-
-
-def test_selfloops_raises():
-    G = nx.ladder_graph(3)
-    G.add_edge(0, 0)
-    with pytest.raises(nx.NetworkXError, match=".*not bipartite"):
-        nx.bipartite.maximal_extendability(G)
-
-
-def test_disconnected_raises():
-    G = nx.ladder_graph(3)
-    G.add_node("a")
-    with pytest.raises(nx.NetworkXError, match=".*not connected"):
-        nx.bipartite.maximal_extendability(G)
-
-
-def test_not_bipartite_raises():
-    G = nx.complete_graph(5)
-    with pytest.raises(nx.NetworkXError, match=".*not bipartite"):
-        nx.bipartite.maximal_extendability(G)
-
-
-def test_no_perfect_matching_raises():
-    G = nx.Graph([(0, 1), (0, 2)])
-    with pytest.raises(nx.NetworkXError, match=".*not contain a perfect matching"):
-        nx.bipartite.maximal_extendability(G)
-
-
-def test_residual_graph_not_strongly_connected_raises():
-    G = nx.Graph([(1, 2), (2, 3), (3, 4)])
-    with pytest.raises(
-        nx.NetworkXError, match="The residual graph of G is not strongly connected"
-    ):
-        nx.bipartite.maximal_extendability(G)
-
-
-def test_ladder_graph_is_1():
-    G = nx.ladder_graph(3)
-    assert nx.bipartite.maximal_extendability(G) == 1
-
-
-def test_cubical_graph_is_2():
-    G = nx.cubical_graph()
-    assert nx.bipartite.maximal_extendability(G) == 2
-
-
-def test_k_is_3():
-    G = nx.Graph(
-        [
-            (1, 6),
-            (1, 7),
-            (1, 8),
-            (1, 9),
-            (2, 6),
-            (2, 7),
-            (2, 8),
-            (2, 10),
-            (3, 6),
-            (3, 8),
-            (3, 9),
-            (3, 10),
-            (4, 7),
-            (4, 8),
-            (4, 9),
-            (4, 10),
-            (5, 6),
-            (5, 7),
-            (5, 9),
-            (5, 10),
-        ]
-    )
-    assert nx.bipartite.maximal_extendability(G) == 3
-
-
-def test_k_is_4():
-    G = nx.Graph(
-        [
-            (8, 1),
-            (8, 2),
-            (8, 3),
-            (8, 4),
-            (8, 5),
-            (9, 1),
-            (9, 2),
-            (9, 3),
-            (9, 4),
-            (9, 7),
-            (10, 1),
-            (10, 2),
-            (10, 3),
-            (10, 4),
-            (10, 6),
-            (11, 1),
-            (11, 2),
-            (11, 5),
-            (11, 6),
-            (11, 7),
-            (12, 1),
-            (12, 3),
-            (12, 5),
-            (12, 6),
-            (12, 7),
-            (13, 2),
-            (13, 4),
-            (13, 5),
-            (13, 6),
-            (13, 7),
-            (14, 3),
-            (14, 4),
-            (14, 5),
-            (14, 6),
-            (14, 7),
-        ]
-    )
-    assert nx.bipartite.maximal_extendability(G) == 4
-
-
-def test_k_is_5():
-    G = nx.Graph(
-        [
-            (8, 1),
-            (8, 2),
-            (8, 3),
-            (8, 4),
-            (8, 5),
-            (8, 6),
-            (9, 1),
-            (9, 2),
-            (9, 3),
-            (9, 4),
-            (9, 5),
-            (9, 7),
-            (10, 1),
-            (10, 2),
-            (10, 3),
-            (10, 4),
-            (10, 6),
-            (10, 7),
-            (11, 1),
-            (11, 2),
-            (11, 3),
-            (11, 5),
-            (11, 6),
-            (11, 7),
-            (12, 1),
-            (12, 2),
-            (12, 4),
-            (12, 5),
-            (12, 6),
-            (12, 7),
-            (13, 1),
-            (13, 3),
-            (13, 4),
-            (13, 5),
-            (13, 6),
-            (13, 7),
-            (14, 2),
-            (14, 3),
-            (14, 4),
-            (14, 5),
-            (14, 6),
-            (14, 7),
-        ]
-    )
-    assert nx.bipartite.maximal_extendability(G) == 5
-
-
-def test_k_is_6():
-    G = nx.Graph(
-        [
-            (9, 1),
-            (9, 2),
-            (9, 3),
-            (9, 4),
-            (9, 5),
-            (9, 6),
-            (9, 7),
-            (10, 1),
-            (10, 2),
-            (10, 3),
-            (10, 4),
-            (10, 5),
-            (10, 6),
-            (10, 8),
-            (11, 1),
-            (11, 2),
-            (11, 3),
-            (11, 4),
-            (11, 5),
-            (11, 7),
-            (11, 8),
-            (12, 1),
-            (12, 2),
-            (12, 3),
-            (12, 4),
-            (12, 6),
-            (12, 7),
-            (12, 8),
-            (13, 1),
-            (13, 2),
-            (13, 3),
-            (13, 5),
-            (13, 6),
-            (13, 7),
-            (13, 8),
-            (14, 1),
-            (14, 2),
-            (14, 4),
-            (14, 5),
-            (14, 6),
-            (14, 7),
-            (14, 8),
-            (15, 1),
-            (15, 3),
-            (15, 4),
-            (15, 5),
-            (15, 6),
-            (15, 7),
-            (15, 8),
-            (16, 2),
-            (16, 3),
-            (16, 4),
-            (16, 5),
-            (16, 6),
-            (16, 7),
-            (16, 8),
-        ]
-    )
-    assert nx.bipartite.maximal_extendability(G) == 6
-
-
-def test_k_is_7():
-    G = nx.Graph(
-        [
-            (1, 11),
-            (1, 12),
-            (1, 13),
-            (1, 14),
-            (1, 15),
-            (1, 16),
-            (1, 17),
-            (1, 18),
-            (2, 11),
-            (2, 12),
-            (2, 13),
-            (2, 14),
-            (2, 15),
-            (2, 16),
-            (2, 17),
-            (2, 19),
-            (3, 11),
-            (3, 12),
-            (3, 13),
-            (3, 14),
-            (3, 15),
-            (3, 16),
-            (3, 17),
-            (3, 20),
-            (4, 11),
-            (4, 12),
-            (4, 13),
-            (4, 14),
-            (4, 15),
-            (4, 16),
-            (4, 17),
-            (4, 18),
-            (4, 19),
-            (4, 20),
-            (5, 11),
-            (5, 12),
-            (5, 13),
-            (5, 14),
-            (5, 15),
-            (5, 16),
-            (5, 17),
-            (5, 18),
-            (5, 19),
-            (5, 20),
-            (6, 11),
-            (6, 12),
-            (6, 13),
-            (6, 14),
-            (6, 15),
-            (6, 16),
-            (6, 17),
-            (6, 18),
-            (6, 19),
-            (6, 20),
-            (7, 11),
-            (7, 12),
-            (7, 13),
-            (7, 14),
-            (7, 15),
-            (7, 16),
-            (7, 17),
-            (7, 18),
-            (7, 19),
-            (7, 20),
-            (8, 11),
-            (8, 12),
-            (8, 13),
-            (8, 14),
-            (8, 15),
-            (8, 16),
-            (8, 17),
-            (8, 18),
-            (8, 19),
-            (8, 20),
-            (9, 11),
-            (9, 12),
-            (9, 13),
-            (9, 14),
-            (9, 15),
-            (9, 16),
-            (9, 17),
-            (9, 18),
-            (9, 19),
-            (9, 20),
-            (10, 11),
-            (10, 12),
-            (10, 13),
-            (10, 14),
-            (10, 15),
-            (10, 16),
-            (10, 17),
-            (10, 18),
-            (10, 19),
-            (10, 20),
-        ]
-    )
-    assert nx.bipartite.maximal_extendability(G) == 7