okstra 0.114.0 → 0.116.0

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

@@ -1,431 +0,0 @@
-"""Unit testing for time dependent algorithms."""
-
-from datetime import datetime, timedelta
-
-import pytest
-
-import networkx as nx
-
-_delta = timedelta(days=5 * 365)
-
-
-class TestCdIndex:
-    """Unit testing for the cd index function."""
-
-    def test_common_graph(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 1)
-        G.add_edge(4, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(1997, 1, 1)},
-            6: {"time": datetime(1998, 1, 1)},
-            7: {"time": datetime(1999, 1, 1)},
-            8: {"time": datetime(1999, 1, 1)},
-            9: {"time": datetime(1998, 1, 1)},
-            10: {"time": datetime(1997, 4, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        assert nx.cd_index(G, 4, time_delta=_delta) == 0.17
-
-    def test_common_graph_with_given_attributes(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 1)
-        G.add_edge(4, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"date": datetime(1992, 1, 1)},
-            1: {"date": datetime(1992, 1, 1)},
-            2: {"date": datetime(1993, 1, 1)},
-            3: {"date": datetime(1993, 1, 1)},
-            4: {"date": datetime(1995, 1, 1)},
-            5: {"date": datetime(1997, 1, 1)},
-            6: {"date": datetime(1998, 1, 1)},
-            7: {"date": datetime(1999, 1, 1)},
-            8: {"date": datetime(1999, 1, 1)},
-            9: {"date": datetime(1998, 1, 1)},
-            10: {"date": datetime(1997, 4, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        assert nx.cd_index(G, 4, time_delta=_delta, time="date") == 0.17
-
-    def test_common_graph_with_int_attributes(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 1)
-        G.add_edge(4, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": 20},
-            1: {"time": 20},
-            2: {"time": 30},
-            3: {"time": 30},
-            4: {"time": 50},
-            5: {"time": 70},
-            6: {"time": 80},
-            7: {"time": 90},
-            8: {"time": 90},
-            9: {"time": 80},
-            10: {"time": 74},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        assert nx.cd_index(G, 4, time_delta=50) == 0.17
-
-    def test_common_graph_with_float_attributes(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 1)
-        G.add_edge(4, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": 20.2},
-            1: {"time": 20.2},
-            2: {"time": 30.7},
-            3: {"time": 30.7},
-            4: {"time": 50.9},
-            5: {"time": 70.1},
-            6: {"time": 80.6},
-            7: {"time": 90.7},
-            8: {"time": 90.7},
-            9: {"time": 80.6},
-            10: {"time": 74.2},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        assert nx.cd_index(G, 4, time_delta=50) == 0.17
-
-    def test_common_graph_with_weights(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 1)
-        G.add_edge(4, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(1997, 1, 1)},
-            6: {"time": datetime(1998, 1, 1), "weight": 5},
-            7: {"time": datetime(1999, 1, 1), "weight": 2},
-            8: {"time": datetime(1999, 1, 1), "weight": 6},
-            9: {"time": datetime(1998, 1, 1), "weight": 3},
-            10: {"time": datetime(1997, 4, 1), "weight": 10},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-        assert nx.cd_index(G, 4, time_delta=_delta, weight="weight") == 0.04
-
-    def test_node_with_no_predecessors(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(2005, 1, 1)},
-            6: {"time": datetime(2010, 1, 1)},
-            7: {"time": datetime(2001, 1, 1)},
-            8: {"time": datetime(2020, 1, 1)},
-            9: {"time": datetime(2017, 1, 1)},
-            10: {"time": datetime(2004, 4, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-        assert nx.cd_index(G, 4, time_delta=_delta) == 0.0
-
-    def test_node_with_no_successors(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(8, 2)
-        G.add_edge(6, 0)
-        G.add_edge(6, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(1997, 1, 1)},
-            6: {"time": datetime(1998, 1, 1)},
-            7: {"time": datetime(1999, 1, 1)},
-            8: {"time": datetime(1999, 1, 1)},
-            9: {"time": datetime(1998, 1, 1)},
-            10: {"time": datetime(1997, 4, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-        assert nx.cd_index(G, 4, time_delta=_delta) == 1.0
-
-    def test_n_equals_zero(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 3)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(2005, 1, 1)},
-            6: {"time": datetime(2010, 1, 1)},
-            7: {"time": datetime(2001, 1, 1)},
-            8: {"time": datetime(2020, 1, 1)},
-            9: {"time": datetime(2017, 1, 1)},
-            10: {"time": datetime(2004, 4, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        with pytest.raises(
-            nx.NetworkXError, match="The cd index cannot be defined."
-        ) as ve:
-            nx.cd_index(G, 4, time_delta=_delta)
-
-    def test_time_timedelta_compatibility(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(4, 2)
-        G.add_edge(4, 0)
-        G.add_edge(4, 3)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": 20.2},
-            1: {"time": 20.2},
-            2: {"time": 30.7},
-            3: {"time": 30.7},
-            4: {"time": 50.9},
-            5: {"time": 70.1},
-            6: {"time": 80.6},
-            7: {"time": 90.7},
-            8: {"time": 90.7},
-            9: {"time": 80.6},
-            10: {"time": 74.2},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        with pytest.raises(
-            nx.NetworkXError,
-            match="Addition and comparison are not supported between",
-        ) as ve:
-            nx.cd_index(G, 4, time_delta=_delta)
-
-    def test_node_with_no_time(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
-        G.add_edge(8, 2)
-        G.add_edge(6, 0)
-        G.add_edge(6, 3)
-        G.add_edge(5, 2)
-        G.add_edge(6, 2)
-        G.add_edge(6, 4)
-        G.add_edge(7, 4)
-        G.add_edge(8, 4)
-        G.add_edge(9, 4)
-        G.add_edge(9, 1)
-        G.add_edge(9, 3)
-        G.add_edge(10, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            6: {"time": datetime(1998, 1, 1)},
-            7: {"time": datetime(1999, 1, 1)},
-            8: {"time": datetime(1999, 1, 1)},
-            9: {"time": datetime(1998, 1, 1)},
-            10: {"time": datetime(1997, 4, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        with pytest.raises(
-            nx.NetworkXError, match="Not all nodes have a 'time' attribute."
-        ) as ve:
-            nx.cd_index(G, 4, time_delta=_delta)
-
-    def test_maximally_consolidating(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])
-        G.add_edge(5, 1)
-        G.add_edge(5, 2)
-        G.add_edge(5, 3)
-        G.add_edge(5, 4)
-        G.add_edge(6, 1)
-        G.add_edge(6, 5)
-        G.add_edge(7, 1)
-        G.add_edge(7, 5)
-        G.add_edge(8, 2)
-        G.add_edge(8, 5)
-        G.add_edge(9, 5)
-        G.add_edge(9, 3)
-        G.add_edge(10, 5)
-        G.add_edge(10, 3)
-        G.add_edge(10, 4)
-        G.add_edge(11, 5)
-        G.add_edge(11, 4)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(1997, 1, 1)},
-            6: {"time": datetime(1998, 1, 1)},
-            7: {"time": datetime(1999, 1, 1)},
-            8: {"time": datetime(1999, 1, 1)},
-            9: {"time": datetime(1998, 1, 1)},
-            10: {"time": datetime(1997, 4, 1)},
-            11: {"time": datetime(1998, 5, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        assert nx.cd_index(G, 5, time_delta=_delta) == -1
-
-    def test_maximally_destabilizing(self):
-        G = nx.DiGraph()
-        G.add_nodes_from([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])
-        G.add_edge(5, 1)
-        G.add_edge(5, 2)
-        G.add_edge(5, 3)
-        G.add_edge(5, 4)
-        G.add_edge(6, 5)
-        G.add_edge(7, 5)
-        G.add_edge(8, 5)
-        G.add_edge(9, 5)
-        G.add_edge(10, 5)
-        G.add_edge(11, 5)
-
-        node_attrs = {
-            0: {"time": datetime(1992, 1, 1)},
-            1: {"time": datetime(1992, 1, 1)},
-            2: {"time": datetime(1993, 1, 1)},
-            3: {"time": datetime(1993, 1, 1)},
-            4: {"time": datetime(1995, 1, 1)},
-            5: {"time": datetime(1997, 1, 1)},
-            6: {"time": datetime(1998, 1, 1)},
-            7: {"time": datetime(1999, 1, 1)},
-            8: {"time": datetime(1999, 1, 1)},
-            9: {"time": datetime(1998, 1, 1)},
-            10: {"time": datetime(1997, 4, 1)},
-            11: {"time": datetime(1998, 5, 1)},
-        }
-
-        nx.set_node_attributes(G, node_attrs)
-
-        assert nx.cd_index(G, 5, time_delta=_delta) == 1

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

@@ -1,161 +0,0 @@
-"""Unit tests for the :mod:`networkx.algorithms.tournament` module."""
-
-from itertools import combinations
-
-import pytest
-
-from networkx import DiGraph
-from networkx.algorithms.tournament import (
-    hamiltonian_path,
-    index_satisfying,
-    is_reachable,
-    is_strongly_connected,
-    is_tournament,
-    random_tournament,
-    score_sequence,
-    tournament_matrix,
-)
-
-
-def test_condition_not_satisfied():
-    iter_in = [0]
-    assert index_satisfying(iter_in, lambda x: x > 0) == 1
-
-
-def test_empty_iterable():
-    with pytest.raises(ValueError):
-        index_satisfying([], lambda x: x > 0)
-
-
-def test_is_tournament():
-    G = DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (0, 2)])
-    assert is_tournament(G)
-
-
-def test_self_loops():
-    """A tournament must have no self-loops."""
-    G = DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (0, 2)])
-    G.add_edge(0, 0)
-    assert not is_tournament(G)
-
-
-def test_missing_edges():
-    """A tournament must not have any pair of nodes without at least
-    one edge joining the pair.
-
-    """
-    G = DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)])
-    assert not is_tournament(G)
-
-
-def test_bidirectional_edges():
-    """A tournament must not have any pair of nodes with greater
-    than one edge joining the pair.
-
-    """
-    G = DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (0, 2)])
-    G.add_edge(1, 0)
-    assert not is_tournament(G)
-
-
-def test_graph_is_tournament():
-    for _ in range(10):
-        G = random_tournament(5)
-        assert is_tournament(G)
-
-
-def test_graph_is_tournament_seed():
-    for _ in range(10):
-        G = random_tournament(5, seed=1)
-        assert is_tournament(G)
-
-
-def test_graph_is_tournament_one_node():
-    G = random_tournament(1)
-    assert is_tournament(G)
-
-
-def test_graph_is_tournament_zero_node():
-    G = random_tournament(0)
-    assert is_tournament(G)
-
-
-def test_hamiltonian_empty_graph():
-    path = hamiltonian_path(DiGraph())
-    assert len(path) == 0
-
-
-def test_path_is_hamiltonian():
-    G = DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (0, 2)])
-    path = hamiltonian_path(G)
-    assert len(path) == 4
-    assert all(v in G[u] for u, v in zip(path, path[1:]))
-
-
-def test_hamiltonian_cycle():
-    """Tests that :func:`networkx.tournament.hamiltonian_path`
-    returns a Hamiltonian cycle when provided a strongly connected
-    tournament.
-
-    """
-    G = DiGraph()
-    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (0, 2)])
-    path = hamiltonian_path(G)
-    assert len(path) == 4
-    assert all(v in G[u] for u, v in zip(path, path[1:]))
-    assert path[0] in G[path[-1]]
-
-
-def test_score_sequence_edge():
-    G = DiGraph([(0, 1)])
-    assert score_sequence(G) == [0, 1]
-
-
-def test_score_sequence_triangle():
-    G = DiGraph([(0, 1), (1, 2), (2, 0)])
-    assert score_sequence(G) == [1, 1, 1]
-
-
-def test_tournament_matrix():
-    np = pytest.importorskip("numpy")
-    pytest.importorskip("scipy")
-    npt = np.testing
-    G = DiGraph([(0, 1)])
-    m = tournament_matrix(G)
-    npt.assert_array_equal(m.todense(), np.array([[0, 1], [-1, 0]]))
-
-
-def test_reachable_pair():
-    """Tests for a reachable pair of nodes."""
-    G = DiGraph([(0, 1), (1, 2), (2, 0)])
-    assert is_reachable(G, 0, 2)
-
-
-def test_same_node_is_reachable():
-    """Tests that a node is always reachable from it."""
-    # G is an arbitrary tournament on ten nodes.
-    G = DiGraph(sorted(p) for p in combinations(range(10), 2))
-    assert all(is_reachable(G, v, v) for v in G)
-
-
-def test_unreachable_pair():
-    """Tests for an unreachable pair of nodes."""
-    G = DiGraph([(0, 1), (0, 2), (1, 2)])
-    assert not is_reachable(G, 1, 0)
-
-
-def test_is_strongly_connected():
-    """Tests for a strongly connected tournament."""
-    G = DiGraph([(0, 1), (1, 2), (2, 0)])
-    assert is_strongly_connected(G)
-
-
-def test_not_strongly_connected():
-    """Tests for a tournament that is not strongly connected."""
-    G = DiGraph([(0, 1), (0, 2), (1, 2)])
-    assert not is_strongly_connected(G)