okstra 0.114.0 → 0.116.0

package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_graphical.py

@@ -1,163 +0,0 @@
-import pytest
-
-import networkx as nx
-
-
-def test_valid_degree_sequence1():
-    n = 100
-    p = 0.3
-    for i in range(10):
-        G = nx.erdos_renyi_graph(n, p)
-        deg = (d for n, d in G.degree())
-        assert nx.is_graphical(deg, method="eg")
-        assert nx.is_graphical(deg, method="hh")
-
-
-def test_valid_degree_sequence2():
-    n = 100
-    for i in range(10):
-        G = nx.barabasi_albert_graph(n, 1)
-        deg = (d for n, d in G.degree())
-        assert nx.is_graphical(deg, method="eg")
-        assert nx.is_graphical(deg, method="hh")
-
-
-def test_string_input():
-    pytest.raises(nx.NetworkXException, nx.is_graphical, [], "foo")
-    pytest.raises(nx.NetworkXException, nx.is_graphical, ["red"], "hh")
-    pytest.raises(nx.NetworkXException, nx.is_graphical, ["red"], "eg")
-
-
-def test_non_integer_input():
-    pytest.raises(nx.NetworkXException, nx.is_graphical, [72.5], "eg")
-    pytest.raises(nx.NetworkXException, nx.is_graphical, [72.5], "hh")
-
-
-def test_negative_input():
-    assert not nx.is_graphical([-1], "hh")
-    assert not nx.is_graphical([-1], "eg")
-
-
-class TestAtlas:
-    @classmethod
-    def setup_class(cls):
-        global atlas
-        from networkx.generators import atlas
-
-        cls.GAG = atlas.graph_atlas_g()
-
-    def test_atlas(self):
-        for graph in self.GAG:
-            deg = (d for n, d in graph.degree())
-            assert nx.is_graphical(deg, method="eg")
-            assert nx.is_graphical(deg, method="hh")
-
-
-def test_small_graph_true():
-    z = [5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1]
-    assert nx.is_graphical(z, method="hh")
-    assert nx.is_graphical(z, method="eg")
-    z = [10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2]
-    assert nx.is_graphical(z, method="hh")
-    assert nx.is_graphical(z, method="eg")
-    z = [1, 1, 1, 1, 1, 2, 2, 2, 3, 4]
-    assert nx.is_graphical(z, method="hh")
-    assert nx.is_graphical(z, method="eg")
-
-
-def test_small_graph_false():
-    z = [1000, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1]
-    assert not nx.is_graphical(z, method="hh")
-    assert not nx.is_graphical(z, method="eg")
-    z = [6, 5, 4, 4, 2, 1, 1, 1]
-    assert not nx.is_graphical(z, method="hh")
-    assert not nx.is_graphical(z, method="eg")
-    z = [1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 4]
-    assert not nx.is_graphical(z, method="hh")
-    assert not nx.is_graphical(z, method="eg")
-
-
-def test_directed_degree_sequence():
-    # Test a range of valid directed degree sequences
-    n, r = 100, 10
-    p = 1.0 / r
-    for i in range(r):
-        G = nx.erdos_renyi_graph(n, p * (i + 1), None, True)
-        din = (d for n, d in G.in_degree())
-        dout = (d for n, d in G.out_degree())
-        assert nx.is_digraphical(din, dout)
-
-
-def test_small_directed_sequences():
-    dout = [5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1]
-    din = [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1]
-    assert nx.is_digraphical(din, dout)
-    # Test nongraphical directed sequence
-    dout = [1000, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1]
-    din = [103, 102, 102, 102, 102, 102, 102, 102, 102, 102]
-    assert not nx.is_digraphical(din, dout)
-    # Test digraphical small sequence
-    dout = [1, 1, 1, 1, 1, 2, 2, 2, 3, 4]
-    din = [2, 2, 2, 2, 2, 2, 2, 2, 1, 1]
-    assert nx.is_digraphical(din, dout)
-    # Test nonmatching sum
-    din = [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1]
-    assert not nx.is_digraphical(din, dout)
-    # Test for negative integer in sequence
-    din = [2, 2, 2, -2, 2, 2, 2, 2, 1, 1, 4]
-    assert not nx.is_digraphical(din, dout)
-    # Test for noninteger
-    din = dout = [1, 1, 1.1, 1]
-    assert not nx.is_digraphical(din, dout)
-    din = dout = [1, 1, "rer", 1]
-    assert not nx.is_digraphical(din, dout)
-
-
-def test_multi_sequence():
-    # Test nongraphical multi sequence
-    seq = [1000, 3, 3, 3, 3, 2, 2, 2, 1, 1]
-    assert not nx.is_multigraphical(seq)
-    # Test small graphical multi sequence
-    seq = [6, 5, 4, 4, 2, 1, 1, 1]
-    assert nx.is_multigraphical(seq)
-    # Test for negative integer in sequence
-    seq = [6, 5, 4, -4, 2, 1, 1, 1]
-    assert not nx.is_multigraphical(seq)
-    # Test for sequence with odd sum
-    seq = [1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 4]
-    assert not nx.is_multigraphical(seq)
-    # Test for noninteger
-    seq = [1, 1, 1.1, 1]
-    assert not nx.is_multigraphical(seq)
-    seq = [1, 1, "rer", 1]
-    assert not nx.is_multigraphical(seq)
-
-
-def test_pseudo_sequence():
-    # Test small valid pseudo sequence
-    seq = [1000, 3, 3, 3, 3, 2, 2, 2, 1, 1]
-    assert nx.is_pseudographical(seq)
-    # Test for sequence with odd sum
-    seq = [1000, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1]
-    assert not nx.is_pseudographical(seq)
-    # Test for negative integer in sequence
-    seq = [1000, 3, 3, 3, 3, 2, 2, -2, 1, 1]
-    assert not nx.is_pseudographical(seq)
-    # Test for noninteger
-    seq = [1, 1, 1.1, 1]
-    assert not nx.is_pseudographical(seq)
-    seq = [1, 1, "rer", 1]
-    assert not nx.is_pseudographical(seq)
-
-
-def test_numpy_degree_sequence():
-    np = pytest.importorskip("numpy")
-    ds = np.array([1, 2, 2, 2, 1], dtype=np.int64)
-    assert nx.is_graphical(ds, "eg")
-    assert nx.is_graphical(ds, "hh")
-    ds = np.array([1, 2, 2, 2, 1], dtype=np.float64)
-    assert nx.is_graphical(ds, "eg")
-    assert nx.is_graphical(ds, "hh")
-    ds = np.array([1.1, 2, 2, 2, 1], dtype=np.float64)
-    pytest.raises(nx.NetworkXException, nx.is_graphical, ds, "eg")
-    pytest.raises(nx.NetworkXException, nx.is_graphical, ds, "hh")

package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_hierarchy.py

@@ -1,46 +0,0 @@
-import pytest
-
-import networkx as nx
-
-
-def test_hierarchy_undirected():
-    G = nx.cycle_graph(5)
-    pytest.raises(nx.NetworkXError, nx.flow_hierarchy, G)
-
-
-def test_hierarchy_cycle():
-    G = nx.cycle_graph(5, create_using=nx.DiGraph())
-    assert nx.flow_hierarchy(G) == 0.0
-
-
-def test_hierarchy_tree():
-    G = nx.full_rary_tree(2, 16, create_using=nx.DiGraph())
-    assert nx.flow_hierarchy(G) == 1.0
-
-
-def test_hierarchy_1():
-    G = nx.DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 1), (3, 4), (0, 4)])
-    assert nx.flow_hierarchy(G) == 0.5
-
-
-def test_hierarchy_weight():
-    G = nx.DiGraph()
-    G.add_edges_from(
-        [
-            (0, 1, {"weight": 0.3}),
-            (1, 2, {"weight": 0.1}),
-            (2, 3, {"weight": 0.1}),
-            (3, 1, {"weight": 0.1}),
-            (3, 4, {"weight": 0.3}),
-            (0, 4, {"weight": 0.3}),
-        ]
-    )
-    assert nx.flow_hierarchy(G, weight="weight") == 0.75
-
-
-@pytest.mark.parametrize("n", (0, 1, 3))
-def test_hierarchy_empty_graph(n):
-    G = nx.empty_graph(n, create_using=nx.DiGraph)
-    with pytest.raises(nx.NetworkXError, match=".*not applicable to empty graphs"):
-        nx.flow_hierarchy(G)

package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_hybrid.py

@@ -1,24 +0,0 @@
-import networkx as nx
-
-
-def test_2d_grid_graph():
-    # FC article claims 2d grid graph of size n is (3,3)-connected
-    # and (5,9)-connected, but I don't think it is (5,9)-connected
-    G = nx.grid_2d_graph(8, 8, periodic=True)
-    assert nx.is_kl_connected(G, 3, 3)
-    assert not nx.is_kl_connected(G, 5, 9)
-    (H, graphOK) = nx.kl_connected_subgraph(G, 5, 9, same_as_graph=True)
-    assert not graphOK
-
-
-def test_small_graph():
-    G = nx.Graph()
-    G.add_edge(1, 2)
-    G.add_edge(1, 3)
-    G.add_edge(2, 3)
-    assert nx.is_kl_connected(G, 2, 2)
-    H = nx.kl_connected_subgraph(G, 2, 2)
-    (H, graphOK) = nx.kl_connected_subgraph(
-        G, 2, 2, low_memory=True, same_as_graph=True
-    )
-    assert graphOK

package/runtime/python/okstra_vendor/networkx/algorithms/tests/test_isolate.py

@@ -1,26 +0,0 @@
-"""Unit tests for the :mod:`networkx.algorithms.isolates` module."""
-
-import networkx as nx
-
-
-def test_is_isolate():
-    G = nx.Graph()
-    G.add_edge(0, 1)
-    G.add_node(2)
-    assert not nx.is_isolate(G, 0)
-    assert not nx.is_isolate(G, 1)
-    assert nx.is_isolate(G, 2)
-
-
-def test_isolates():
-    G = nx.Graph()
-    G.add_edge(0, 1)
-    G.add_nodes_from([2, 3])
-    assert sorted(nx.isolates(G)) == [2, 3]
-
-
-def test_number_of_isolates():
-    G = nx.Graph()
-    G.add_edge(0, 1)
-    G.add_nodes_from([2, 3])
-    assert nx.number_of_isolates(G) == 2