okstra 0.113.0 → 0.115.0

package/runtime/python/okstra_vendor/networkx/linalg/tests/test_spectrum.py

@@ -1,70 +0,0 @@
-import pytest
-
-import networkx as nx
-
-np = pytest.importorskip("numpy")
-pytest.importorskip("scipy")
-
-
-class TestSpectrum:
-    @classmethod
-    def setup_class(cls):
-        deg = [3, 2, 2, 1, 0]
-        cls.G = nx.havel_hakimi_graph(deg)
-        cls.P = nx.path_graph(3)
-        cls.WG = nx.Graph(
-            (u, v, {"weight": 0.5, "other": 0.3}) for (u, v) in cls.G.edges()
-        )
-        cls.WG.add_node(4)
-        cls.DG = nx.DiGraph()
-        nx.add_path(cls.DG, [0, 1, 2])
-
-    def test_laplacian_spectrum(self):
-        "Laplacian eigenvalues"
-        evals = np.array([0, 0, 1, 3, 4])
-        e = sorted(nx.laplacian_spectrum(self.G))
-        np.testing.assert_almost_equal(e, evals)
-        e = sorted(nx.laplacian_spectrum(self.WG, weight=None))
-        np.testing.assert_almost_equal(e, evals)
-        e = sorted(nx.laplacian_spectrum(self.WG))
-        np.testing.assert_almost_equal(e, 0.5 * evals)
-        e = sorted(nx.laplacian_spectrum(self.WG, weight="other"))
-        np.testing.assert_almost_equal(e, 0.3 * evals)
-
-    def test_normalized_laplacian_spectrum(self):
-        "Normalized Laplacian eigenvalues"
-        evals = np.array([0, 0, 0.7712864461218, 1.5, 1.7287135538781])
-        e = sorted(nx.normalized_laplacian_spectrum(self.G))
-        np.testing.assert_almost_equal(e, evals)
-        e = sorted(nx.normalized_laplacian_spectrum(self.WG, weight=None))
-        np.testing.assert_almost_equal(e, evals)
-        e = sorted(nx.normalized_laplacian_spectrum(self.WG))
-        np.testing.assert_almost_equal(e, evals)
-        e = sorted(nx.normalized_laplacian_spectrum(self.WG, weight="other"))
-        np.testing.assert_almost_equal(e, evals)
-
-    def test_adjacency_spectrum(self):
-        "Adjacency eigenvalues"
-        evals = np.array([-np.sqrt(2), 0, np.sqrt(2)])
-        e = sorted(nx.adjacency_spectrum(self.P))
-        np.testing.assert_almost_equal(e, evals)
-
-    def test_modularity_spectrum(self):
-        "Modularity eigenvalues"
-        evals = np.array([-1.5, 0.0, 0.0])
-        e = sorted(nx.modularity_spectrum(self.P))
-        np.testing.assert_almost_equal(e, evals)
-        # Directed modularity eigenvalues
-        evals = np.array([-0.5, 0.0, 0.0])
-        e = sorted(nx.modularity_spectrum(self.DG))
-        np.testing.assert_almost_equal(e, evals)
-
-    def test_bethe_hessian_spectrum(self):
-        "Bethe Hessian eigenvalues"
-        evals = np.array([0.5 * (9 - np.sqrt(33)), 4, 0.5 * (9 + np.sqrt(33))])
-        e = sorted(nx.bethe_hessian_spectrum(self.P, r=2))
-        np.testing.assert_almost_equal(e, evals)
-        # Collapses back to Laplacian:
-        e1 = sorted(nx.bethe_hessian_spectrum(self.P, r=1))
-        e2 = sorted(nx.laplacian_spectrum(self.P))
-        np.testing.assert_almost_equal(e1, e2)

package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_adjacency.py

@@ -1,78 +0,0 @@
-import copy
-import json
-
-import pytest
-
-import networkx as nx
-from networkx.readwrite.json_graph import adjacency_data, adjacency_graph
-from networkx.utils import graphs_equal
-
-
-class TestAdjacency:
-    def test_graph(self):
-        G = nx.path_graph(4)
-        H = adjacency_graph(adjacency_data(G))
-        assert graphs_equal(G, H)
-
-    def test_graph_attributes(self):
-        G = nx.path_graph(4)
-        G.add_node(1, color="red")
-        G.add_edge(1, 2, width=7)
-        G.graph["foo"] = "bar"
-        G.graph[1] = "one"
-
-        H = adjacency_graph(adjacency_data(G))
-        assert graphs_equal(G, H)
-        assert H.graph["foo"] == "bar"
-        assert H.nodes[1]["color"] == "red"
-        assert H[1][2]["width"] == 7
-
-        d = json.dumps(adjacency_data(G))
-        H = adjacency_graph(json.loads(d))
-        assert graphs_equal(G, H)
-        assert H.graph["foo"] == "bar"
-        assert H.graph[1] == "one"
-        assert H.nodes[1]["color"] == "red"
-        assert H[1][2]["width"] == 7
-
-    def test_digraph(self):
-        G = nx.DiGraph()
-        nx.add_path(G, [1, 2, 3])
-        H = adjacency_graph(adjacency_data(G))
-        assert H.is_directed()
-        assert graphs_equal(G, H)
-
-    def test_multidigraph(self):
-        G = nx.MultiDiGraph()
-        nx.add_path(G, [1, 2, 3])
-        H = adjacency_graph(adjacency_data(G))
-        assert H.is_directed()
-        assert H.is_multigraph()
-        assert graphs_equal(G, H)
-
-    def test_multigraph(self):
-        G = nx.MultiGraph()
-        G.add_edge(1, 2, key="first")
-        G.add_edge(1, 2, key="second", color="blue")
-        H = adjacency_graph(adjacency_data(G))
-        assert graphs_equal(G, H)
-        assert H[1][2]["second"]["color"] == "blue"
-
-    def test_input_data_is_not_modified_when_building_graph(self):
-        G = nx.path_graph(4)
-        input_data = adjacency_data(G)
-        orig_data = copy.deepcopy(input_data)
-        # Ensure input is unmodified by deserialisation
-        assert graphs_equal(G, adjacency_graph(input_data))
-        assert input_data == orig_data
-
-    def test_adjacency_form_json_serialisable(self):
-        G = nx.path_graph(4)
-        H = adjacency_graph(json.loads(json.dumps(adjacency_data(G))))
-        assert graphs_equal(G, H)
-
-    def test_exception(self):
-        with pytest.raises(nx.NetworkXError):
-            G = nx.MultiDiGraph()
-            attrs = {"id": "node", "key": "node"}
-            adjacency_data(G, attrs)

package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_cytoscape.py

@@ -1,78 +0,0 @@
-import copy
-import json
-
-import pytest
-
-import networkx as nx
-from networkx.readwrite.json_graph import cytoscape_data, cytoscape_graph
-
-
-def test_graph():
-    G = nx.path_graph(4)
-    H = cytoscape_graph(cytoscape_data(G))
-    assert nx.is_isomorphic(G, H)
-
-
-def test_input_data_is_not_modified_when_building_graph():
-    G = nx.path_graph(4)
-    input_data = cytoscape_data(G)
-    orig_data = copy.deepcopy(input_data)
-    # Ensure input is unmodified by cytoscape_graph (gh-4173)
-    cytoscape_graph(input_data)
-    assert input_data == orig_data
-
-
-def test_graph_attributes():
-    G = nx.path_graph(4)
-    G.add_node(1, color="red")
-    G.add_edge(1, 2, width=7)
-    G.graph["foo"] = "bar"
-    G.graph[1] = "one"
-    G.add_node(3, name="node", id="123")
-
-    H = cytoscape_graph(cytoscape_data(G))
-    assert H.graph["foo"] == "bar"
-    assert H.nodes[1]["color"] == "red"
-    assert H[1][2]["width"] == 7
-    assert H.nodes[3]["name"] == "node"
-    assert H.nodes[3]["id"] == "123"
-
-    d = json.dumps(cytoscape_data(G))
-    H = cytoscape_graph(json.loads(d))
-    assert H.graph["foo"] == "bar"
-    assert H.graph[1] == "one"
-    assert H.nodes[1]["color"] == "red"
-    assert H[1][2]["width"] == 7
-    assert H.nodes[3]["name"] == "node"
-    assert H.nodes[3]["id"] == "123"
-
-
-def test_digraph():
-    G = nx.DiGraph()
-    nx.add_path(G, [1, 2, 3])
-    H = cytoscape_graph(cytoscape_data(G))
-    assert H.is_directed()
-    assert nx.is_isomorphic(G, H)
-
-
-def test_multidigraph():
-    G = nx.MultiDiGraph()
-    nx.add_path(G, [1, 2, 3])
-    H = cytoscape_graph(cytoscape_data(G))
-    assert H.is_directed()
-    assert H.is_multigraph()
-
-
-def test_multigraph():
-    G = nx.MultiGraph()
-    G.add_edge(1, 2, key="first")
-    G.add_edge(1, 2, key="second", color="blue")
-    H = cytoscape_graph(cytoscape_data(G))
-    assert nx.is_isomorphic(G, H)
-    assert H[1][2]["second"]["color"] == "blue"
-
-
-def test_exception():
-    with pytest.raises(nx.NetworkXError):
-        G = nx.MultiDiGraph()
-        cytoscape_data(G, name="foo", ident="foo")

package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_node_link.py

@@ -1,109 +0,0 @@
-import json
-
-import pytest
-
-import networkx as nx
-from networkx.readwrite.json_graph import node_link_data, node_link_graph
-
-
-class TestNodeLink:
-    def test_exception_dep(self):
-        G = nx.MultiDiGraph()
-        with pytest.raises(nx.NetworkXError):
-            node_link_data(G, name="node", source="node", target="node", key="node")
-
-    def test_graph(self):
-        G = nx.path_graph(4)
-        H = node_link_graph(node_link_data(G))
-        assert nx.is_isomorphic(G, H)
-
-    def test_graph_attributes(self):
-        G = nx.path_graph(4)
-        G.add_node(1, color="red")
-        G.add_edge(1, 2, width=7)
-        G.graph[1] = "one"
-        G.graph["foo"] = "bar"
-
-        H = node_link_graph(node_link_data(G))
-        assert H.graph["foo"] == "bar"
-        assert H.nodes[1]["color"] == "red"
-        assert H[1][2]["width"] == 7
-
-        d = json.dumps(node_link_data(G))
-        H = node_link_graph(json.loads(d))
-        assert H.graph["foo"] == "bar"
-        assert H.graph["1"] == "one"
-        assert H.nodes[1]["color"] == "red"
-        assert H[1][2]["width"] == 7
-
-    def test_digraph(self):
-        G = nx.DiGraph()
-        H = node_link_graph(node_link_data(G))
-        assert H.is_directed()
-
-    def test_multigraph(self):
-        G = nx.MultiGraph()
-        G.add_edge(1, 2, key="first")
-        G.add_edge(1, 2, key="second", color="blue")
-        H = node_link_graph(node_link_data(G))
-        assert nx.is_isomorphic(G, H)
-        assert H[1][2]["second"]["color"] == "blue"
-
-    def test_graph_with_tuple_nodes(self):
-        G = nx.Graph()
-        G.add_edge((0, 0), (1, 0), color=[255, 255, 0])
-        d = node_link_data(G)
-        dumped_d = json.dumps(d)
-        dd = json.loads(dumped_d)
-        H = node_link_graph(dd)
-        assert H.nodes[(0, 0)] == G.nodes[(0, 0)]
-        assert H[(0, 0)][(1, 0)]["color"] == [255, 255, 0]
-
-    def test_unicode_keys(self):
-        q = "qualité"
-        G = nx.Graph()
-        G.add_node(1, **{q: q})
-        s = node_link_data(G)
-        output = json.dumps(s, ensure_ascii=False)
-        data = json.loads(output)
-        H = node_link_graph(data)
-        assert H.nodes[1][q] == q
-
-    def test_exception(self):
-        G = nx.MultiDiGraph()
-        attrs = {"name": "node", "source": "node", "target": "node", "key": "node"}
-        with pytest.raises(nx.NetworkXError):
-            node_link_data(G, **attrs)
-
-    def test_string_ids(self):
-        q = "qualité"
-        G = nx.DiGraph()
-        G.add_node("A")
-        G.add_node(q)
-        G.add_edge("A", q)
-        data = node_link_data(G)
-        assert data["edges"][0]["source"] == "A"
-        assert data["edges"][0]["target"] == q
-        H = node_link_graph(data)
-        assert nx.is_isomorphic(G, H)
-
-    def test_custom_attrs(self):
-        G = nx.path_graph(4)
-        G.add_node(1, color="red")
-        G.add_edge(1, 2, width=7)
-        G.graph[1] = "one"
-        G.graph["foo"] = "bar"
-
-        attrs = {
-            "source": "c_source",
-            "target": "c_target",
-            "name": "c_id",
-            "key": "c_key",
-            "edges": "c_links",
-        }
-
-        H = node_link_graph(node_link_data(G, **attrs), multigraph=False, **attrs)
-        assert nx.is_isomorphic(G, H)
-        assert H.graph["foo"] == "bar"
-        assert H.nodes[1]["color"] == "red"
-        assert H[1][2]["width"] == 7

package/runtime/python/okstra_vendor/networkx/readwrite/json_graph/tests/test_tree.py

@@ -1,48 +0,0 @@
-import json
-
-import pytest
-
-import networkx as nx
-from networkx.readwrite.json_graph import tree_data, tree_graph
-
-
-def test_graph():
-    G = nx.DiGraph()
-    G.add_nodes_from([1, 2, 3], color="red")
-    G.add_edge(1, 2, foo=7)
-    G.add_edge(1, 3, foo=10)
-    G.add_edge(3, 4, foo=10)
-    H = tree_graph(tree_data(G, 1))
-    assert nx.is_isomorphic(G, H)
-
-
-def test_graph_attributes():
-    G = nx.DiGraph()
-    G.add_nodes_from([1, 2, 3], color="red")
-    G.add_edge(1, 2, foo=7)
-    G.add_edge(1, 3, foo=10)
-    G.add_edge(3, 4, foo=10)
-    H = tree_graph(tree_data(G, 1))
-    assert H.nodes[1]["color"] == "red"
-
-    d = json.dumps(tree_data(G, 1))
-    H = tree_graph(json.loads(d))
-    assert H.nodes[1]["color"] == "red"
-
-
-def test_exceptions():
-    with pytest.raises(TypeError, match="is not a tree."):
-        G = nx.complete_graph(3)
-        tree_data(G, 0)
-    with pytest.raises(TypeError, match="is not directed."):
-        G = nx.path_graph(3)
-        tree_data(G, 0)
-    with pytest.raises(TypeError, match="is not weakly connected."):
-        G = nx.path_graph(3, create_using=nx.DiGraph)
-        G.add_edge(2, 0)
-        G.add_node(3)
-        tree_data(G, 0)
-    with pytest.raises(nx.NetworkXError, match="must be different."):
-        G = nx.MultiDiGraph()
-        G.add_node(0)
-        tree_data(G, 0, ident="node", children="node")