okstra 0.113.0 → 0.115.0

package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_cuts.py

@@ -1,309 +0,0 @@
-import pytest
-
-import networkx as nx
-from networkx.algorithms import flow
-from networkx.algorithms.connectivity import minimum_st_edge_cut, minimum_st_node_cut
-from networkx.utils import arbitrary_element
-
-flow_funcs = [
-    flow.boykov_kolmogorov,
-    flow.dinitz,
-    flow.edmonds_karp,
-    flow.preflow_push,
-    flow.shortest_augmenting_path,
-]
-
-# Tests for node and edge cutsets
-
-
-def _generate_no_biconnected(max_attempts=50):
-    attempts = 0
-    while True:
-        G = nx.fast_gnp_random_graph(100, 0.0575, seed=42)
-        if nx.is_connected(G) and not nx.is_biconnected(G):
-            attempts = 0
-            yield G
-        else:
-            if attempts >= max_attempts:
-                msg = f"Tried {attempts} times: no suitable Graph."
-                raise Exception(msg)
-            else:
-                attempts += 1
-
-
-def test_articulation_points():
-    Ggen = _generate_no_biconnected()
-    for flow_func in flow_funcs:
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        for i in range(1):  # change 1 to 3 or more for more realizations.
-            G = next(Ggen)
-            cut = nx.minimum_node_cut(G, flow_func=flow_func)
-            assert len(cut) == 1, errmsg
-            assert cut.pop() in set(nx.articulation_points(G)), errmsg
-
-
-def test_brandes_erlebach_book():
-    # Figure 1 chapter 7: Connectivity
-    # http://www.informatik.uni-augsburg.de/thi/personen/kammer/Graph_Connectivity.pdf
-    G = nx.Graph()
-    G.add_edges_from(
-        [
-            (1, 2),
-            (1, 3),
-            (1, 4),
-            (1, 5),
-            (2, 3),
-            (2, 6),
-            (3, 4),
-            (3, 6),
-            (4, 6),
-            (4, 7),
-            (5, 7),
-            (6, 8),
-            (6, 9),
-            (7, 8),
-            (7, 10),
-            (8, 11),
-            (9, 10),
-            (9, 11),
-            (10, 11),
-        ]
-    )
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge cutsets
-        assert 3 == len(nx.minimum_edge_cut(G, 1, 11, **kwargs)), errmsg
-        edge_cut = nx.minimum_edge_cut(G, **kwargs)
-        # Node 5 has only two edges
-        assert 2 == len(edge_cut), errmsg
-        H = G.copy()
-        H.remove_edges_from(edge_cut)
-        assert not nx.is_connected(H), errmsg
-        # node cuts
-        assert {6, 7} == minimum_st_node_cut(G, 1, 11, **kwargs), errmsg
-        assert {6, 7} == nx.minimum_node_cut(G, 1, 11, **kwargs), errmsg
-        node_cut = nx.minimum_node_cut(G, **kwargs)
-        assert 2 == len(node_cut), errmsg
-        H = G.copy()
-        H.remove_nodes_from(node_cut)
-        assert not nx.is_connected(H), errmsg
-
-
-def test_white_harary_paper():
-    # Figure 1b white and harary (2001)
-    # https://doi.org/10.1111/0081-1750.00098
-    # A graph with high adhesion (edge connectivity) and low cohesion
-    # (node connectivity)
-    G = nx.disjoint_union(nx.complete_graph(4), nx.complete_graph(4))
-    G.remove_node(7)
-    for i in range(4, 7):
-        G.add_edge(0, i)
-    G = nx.disjoint_union(G, nx.complete_graph(4))
-    G.remove_node(G.order() - 1)
-    for i in range(7, 10):
-        G.add_edge(0, i)
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge cuts
-        edge_cut = nx.minimum_edge_cut(G, **kwargs)
-        assert 3 == len(edge_cut), errmsg
-        H = G.copy()
-        H.remove_edges_from(edge_cut)
-        assert not nx.is_connected(H), errmsg
-        # node cuts
-        node_cut = nx.minimum_node_cut(G, **kwargs)
-        assert {0} == node_cut, errmsg
-        H = G.copy()
-        H.remove_nodes_from(node_cut)
-        assert not nx.is_connected(H), errmsg
-
-
-def test_petersen_cutset():
-    G = nx.petersen_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge cuts
-        edge_cut = nx.minimum_edge_cut(G, **kwargs)
-        assert 3 == len(edge_cut), errmsg
-        H = G.copy()
-        H.remove_edges_from(edge_cut)
-        assert not nx.is_connected(H), errmsg
-        # node cuts
-        node_cut = nx.minimum_node_cut(G, **kwargs)
-        assert 3 == len(node_cut), errmsg
-        H = G.copy()
-        H.remove_nodes_from(node_cut)
-        assert not nx.is_connected(H), errmsg
-
-
-def test_octahedral_cutset():
-    G = nx.octahedral_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge cuts
-        edge_cut = nx.minimum_edge_cut(G, **kwargs)
-        assert 4 == len(edge_cut), errmsg
-        H = G.copy()
-        H.remove_edges_from(edge_cut)
-        assert not nx.is_connected(H), errmsg
-        # node cuts
-        node_cut = nx.minimum_node_cut(G, **kwargs)
-        assert 4 == len(node_cut), errmsg
-        H = G.copy()
-        H.remove_nodes_from(node_cut)
-        assert not nx.is_connected(H), errmsg
-
-
-def test_icosahedral_cutset():
-    G = nx.icosahedral_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge cuts
-        edge_cut = nx.minimum_edge_cut(G, **kwargs)
-        assert 5 == len(edge_cut), errmsg
-        H = G.copy()
-        H.remove_edges_from(edge_cut)
-        assert not nx.is_connected(H), errmsg
-        # node cuts
-        node_cut = nx.minimum_node_cut(G, **kwargs)
-        assert 5 == len(node_cut), errmsg
-        H = G.copy()
-        H.remove_nodes_from(node_cut)
-        assert not nx.is_connected(H), errmsg
-
-
-def test_node_cutset_exception():
-    G = nx.Graph()
-    G.add_edges_from([(1, 2), (3, 4)])
-    for flow_func in flow_funcs:
-        pytest.raises(nx.NetworkXError, nx.minimum_node_cut, G, flow_func=flow_func)
-
-
-def test_node_cutset_random_graphs():
-    for flow_func in flow_funcs:
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        for i in range(3):
-            G = nx.fast_gnp_random_graph(50, 0.25, seed=42)
-            if not nx.is_connected(G):
-                ccs = iter(nx.connected_components(G))
-                start = arbitrary_element(next(ccs))
-                G.add_edges_from((start, arbitrary_element(c)) for c in ccs)
-            cutset = nx.minimum_node_cut(G, flow_func=flow_func)
-            assert nx.node_connectivity(G) == len(cutset), errmsg
-            G.remove_nodes_from(cutset)
-            assert not nx.is_connected(G), errmsg
-
-
-def test_edge_cutset_random_graphs():
-    for flow_func in flow_funcs:
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        for i in range(3):
-            G = nx.fast_gnp_random_graph(50, 0.25, seed=42)
-            if not nx.is_connected(G):
-                ccs = iter(nx.connected_components(G))
-                start = arbitrary_element(next(ccs))
-                G.add_edges_from((start, arbitrary_element(c)) for c in ccs)
-            cutset = nx.minimum_edge_cut(G, flow_func=flow_func)
-            assert nx.edge_connectivity(G) == len(cutset), errmsg
-            G.remove_edges_from(cutset)
-            assert not nx.is_connected(G), errmsg
-
-
-def test_empty_graphs():
-    G = nx.Graph()
-    D = nx.DiGraph()
-    for interface_func in [nx.minimum_node_cut, nx.minimum_edge_cut]:
-        for flow_func in flow_funcs:
-            pytest.raises(
-                nx.NetworkXPointlessConcept, interface_func, G, flow_func=flow_func
-            )
-            pytest.raises(
-                nx.NetworkXPointlessConcept, interface_func, D, flow_func=flow_func
-            )
-
-
-def test_unbounded():
-    G = nx.complete_graph(5)
-    for flow_func in flow_funcs:
-        assert 4 == len(minimum_st_edge_cut(G, 1, 4, flow_func=flow_func))
-
-
-def test_missing_source():
-    G = nx.path_graph(4)
-    for interface_func in [nx.minimum_edge_cut, nx.minimum_node_cut]:
-        for flow_func in flow_funcs:
-            pytest.raises(
-                nx.NetworkXError, interface_func, G, 10, 1, flow_func=flow_func
-            )
-
-
-def test_missing_target():
-    G = nx.path_graph(4)
-    for interface_func in [nx.minimum_edge_cut, nx.minimum_node_cut]:
-        for flow_func in flow_funcs:
-            pytest.raises(
-                nx.NetworkXError, interface_func, G, 1, 10, flow_func=flow_func
-            )
-
-
-def test_not_weakly_connected():
-    G = nx.DiGraph()
-    nx.add_path(G, [1, 2, 3])
-    nx.add_path(G, [4, 5])
-    for interface_func in [nx.minimum_edge_cut, nx.minimum_node_cut]:
-        for flow_func in flow_funcs:
-            pytest.raises(nx.NetworkXError, interface_func, G, flow_func=flow_func)
-
-
-def test_not_connected():
-    G = nx.Graph()
-    nx.add_path(G, [1, 2, 3])
-    nx.add_path(G, [4, 5])
-    for interface_func in [nx.minimum_edge_cut, nx.minimum_node_cut]:
-        for flow_func in flow_funcs:
-            pytest.raises(nx.NetworkXError, interface_func, G, flow_func=flow_func)
-
-
-def tests_min_cut_complete():
-    G = nx.complete_graph(5)
-    for interface_func in [nx.minimum_edge_cut, nx.minimum_node_cut]:
-        for flow_func in flow_funcs:
-            assert 4 == len(interface_func(G, flow_func=flow_func))
-
-
-def tests_min_cut_complete_directed():
-    G = nx.complete_graph(5)
-    G = G.to_directed()
-    for interface_func in [nx.minimum_edge_cut, nx.minimum_node_cut]:
-        for flow_func in flow_funcs:
-            assert 4 == len(interface_func(G, flow_func=flow_func))
-
-
-def tests_minimum_st_node_cut():
-    G = nx.Graph()
-    G.add_nodes_from([0, 1, 2, 3, 7, 8, 11, 12])
-    G.add_edges_from([(7, 11), (1, 11), (1, 12), (12, 8), (0, 1)])
-    nodelist = minimum_st_node_cut(G, 7, 11)
-    assert nodelist == set()
-
-
-def test_invalid_auxiliary():
-    G = nx.complete_graph(5)
-    pytest.raises(nx.NetworkXError, minimum_st_node_cut, G, 0, 3, auxiliary=G)
-
-
-def test_interface_only_source():
-    G = nx.complete_graph(5)
-    for interface_func in [nx.minimum_node_cut, nx.minimum_edge_cut]:
-        pytest.raises(nx.NetworkXError, interface_func, G, s=0)
-
-
-def test_interface_only_target():
-    G = nx.complete_graph(5)
-    for interface_func in [nx.minimum_node_cut, nx.minimum_edge_cut]:
-        pytest.raises(nx.NetworkXError, interface_func, G, t=3)

package/runtime/python/okstra_vendor/networkx/algorithms/connectivity/tests/test_disjoint_paths.py

@@ -1,249 +0,0 @@
-import pytest
-
-import networkx as nx
-from networkx.algorithms import flow
-from networkx.utils import pairwise
-
-flow_funcs = [
-    flow.boykov_kolmogorov,
-    flow.edmonds_karp,
-    flow.dinitz,
-    flow.preflow_push,
-    flow.shortest_augmenting_path,
-]
-
-
-def is_path(G, path):
-    return all(v in G[u] for u, v in pairwise(path))
-
-
-def are_edge_disjoint_paths(G, paths):
-    if not paths:
-        return False
-    for path in paths:
-        assert is_path(G, path)
-    paths_edges = [list(pairwise(p)) for p in paths]
-    num_of_edges = sum(len(e) for e in paths_edges)
-    num_unique_edges = len(set.union(*[set(es) for es in paths_edges]))
-    if num_of_edges == num_unique_edges:
-        return True
-    return False
-
-
-def are_node_disjoint_paths(G, paths):
-    if not paths:
-        return False
-    for path in paths:
-        assert is_path(G, path)
-    # first and last nodes are source and target
-    st = {paths[0][0], paths[0][-1]}
-    num_of_nodes = len([n for path in paths for n in path if n not in st])
-    num_unique_nodes = len({n for path in paths for n in path if n not in st})
-    if num_of_nodes == num_unique_nodes:
-        return True
-    return False
-
-
-def test_graph_from_pr_2053():
-    G = nx.Graph()
-    G.add_edges_from(
-        [
-            ("A", "B"),
-            ("A", "D"),
-            ("A", "F"),
-            ("A", "G"),
-            ("B", "C"),
-            ("B", "D"),
-            ("B", "G"),
-            ("C", "D"),
-            ("C", "E"),
-            ("C", "Z"),
-            ("D", "E"),
-            ("D", "F"),
-            ("E", "F"),
-            ("E", "Z"),
-            ("F", "Z"),
-            ("G", "Z"),
-        ]
-    )
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge disjoint paths
-        edge_paths = list(nx.edge_disjoint_paths(G, "A", "Z", **kwargs))
-        assert are_edge_disjoint_paths(G, edge_paths), errmsg
-        assert nx.edge_connectivity(G, "A", "Z") == len(edge_paths), errmsg
-        # node disjoint paths
-        node_paths = list(nx.node_disjoint_paths(G, "A", "Z", **kwargs))
-        assert are_node_disjoint_paths(G, node_paths), errmsg
-        assert nx.node_connectivity(G, "A", "Z") == len(node_paths), errmsg
-
-
-def test_florentine_families():
-    G = nx.florentine_families_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge disjoint paths
-        edge_dpaths = list(nx.edge_disjoint_paths(G, "Medici", "Strozzi", **kwargs))
-        assert are_edge_disjoint_paths(G, edge_dpaths), errmsg
-        assert nx.edge_connectivity(G, "Medici", "Strozzi") == len(edge_dpaths), errmsg
-        # node disjoint paths
-        node_dpaths = list(nx.node_disjoint_paths(G, "Medici", "Strozzi", **kwargs))
-        assert are_node_disjoint_paths(G, node_dpaths), errmsg
-        assert nx.node_connectivity(G, "Medici", "Strozzi") == len(node_dpaths), errmsg
-
-
-def test_karate():
-    G = nx.karate_club_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge disjoint paths
-        edge_dpaths = list(nx.edge_disjoint_paths(G, 0, 33, **kwargs))
-        assert are_edge_disjoint_paths(G, edge_dpaths), errmsg
-        assert nx.edge_connectivity(G, 0, 33) == len(edge_dpaths), errmsg
-        # node disjoint paths
-        node_dpaths = list(nx.node_disjoint_paths(G, 0, 33, **kwargs))
-        assert are_node_disjoint_paths(G, node_dpaths), errmsg
-        assert nx.node_connectivity(G, 0, 33) == len(node_dpaths), errmsg
-
-
-def test_petersen_disjoint_paths():
-    G = nx.petersen_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge disjoint paths
-        edge_dpaths = list(nx.edge_disjoint_paths(G, 0, 6, **kwargs))
-        assert are_edge_disjoint_paths(G, edge_dpaths), errmsg
-        assert 3 == len(edge_dpaths), errmsg
-        # node disjoint paths
-        node_dpaths = list(nx.node_disjoint_paths(G, 0, 6, **kwargs))
-        assert are_node_disjoint_paths(G, node_dpaths), errmsg
-        assert 3 == len(node_dpaths), errmsg
-
-
-def test_octahedral_disjoint_paths():
-    G = nx.octahedral_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge disjoint paths
-        edge_dpaths = list(nx.edge_disjoint_paths(G, 0, 5, **kwargs))
-        assert are_edge_disjoint_paths(G, edge_dpaths), errmsg
-        assert 4 == len(edge_dpaths), errmsg
-        # node disjoint paths
-        node_dpaths = list(nx.node_disjoint_paths(G, 0, 5, **kwargs))
-        assert are_node_disjoint_paths(G, node_dpaths), errmsg
-        assert 4 == len(node_dpaths), errmsg
-
-
-def test_icosahedral_disjoint_paths():
-    G = nx.icosahedral_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        # edge disjoint paths
-        edge_dpaths = list(nx.edge_disjoint_paths(G, 0, 6, **kwargs))
-        assert are_edge_disjoint_paths(G, edge_dpaths), errmsg
-        assert 5 == len(edge_dpaths), errmsg
-        # node disjoint paths
-        node_dpaths = list(nx.node_disjoint_paths(G, 0, 6, **kwargs))
-        assert are_node_disjoint_paths(G, node_dpaths), errmsg
-        assert 5 == len(node_dpaths), errmsg
-
-
-def test_cutoff_disjoint_paths():
-    G = nx.icosahedral_graph()
-    for flow_func in flow_funcs:
-        kwargs = {"flow_func": flow_func}
-        errmsg = f"Assertion failed in function: {flow_func.__name__}"
-        for cutoff in [2, 4]:
-            kwargs["cutoff"] = cutoff
-            # edge disjoint paths
-            edge_dpaths = list(nx.edge_disjoint_paths(G, 0, 6, **kwargs))
-            assert are_edge_disjoint_paths(G, edge_dpaths), errmsg
-            assert cutoff == len(edge_dpaths), errmsg
-            # node disjoint paths
-            node_dpaths = list(nx.node_disjoint_paths(G, 0, 6, **kwargs))
-            assert are_node_disjoint_paths(G, node_dpaths), errmsg
-            assert cutoff == len(node_dpaths), errmsg
-
-
-def test_missing_source_edge_paths():
-    with pytest.raises(nx.NetworkXError):
-        G = nx.path_graph(4)
-        list(nx.edge_disjoint_paths(G, 10, 1))
-
-
-def test_missing_source_node_paths():
-    with pytest.raises(nx.NetworkXError):
-        G = nx.path_graph(4)
-        list(nx.node_disjoint_paths(G, 10, 1))
-
-
-def test_missing_target_edge_paths():
-    with pytest.raises(nx.NetworkXError):
-        G = nx.path_graph(4)
-        list(nx.edge_disjoint_paths(G, 1, 10))
-
-
-def test_missing_target_node_paths():
-    with pytest.raises(nx.NetworkXError):
-        G = nx.path_graph(4)
-        list(nx.node_disjoint_paths(G, 1, 10))
-
-
-def test_not_weakly_connected_edges():
-    with pytest.raises(nx.NetworkXNoPath):
-        G = nx.DiGraph()
-        nx.add_path(G, [1, 2, 3])
-        nx.add_path(G, [4, 5])
-        list(nx.edge_disjoint_paths(G, 1, 5))
-
-
-def test_not_weakly_connected_nodes():
-    with pytest.raises(nx.NetworkXNoPath):
-        G = nx.DiGraph()
-        nx.add_path(G, [1, 2, 3])
-        nx.add_path(G, [4, 5])
-        list(nx.node_disjoint_paths(G, 1, 5))
-
-
-def test_not_connected_edges():
-    with pytest.raises(nx.NetworkXNoPath):
-        G = nx.Graph()
-        nx.add_path(G, [1, 2, 3])
-        nx.add_path(G, [4, 5])
-        list(nx.edge_disjoint_paths(G, 1, 5))
-
-
-def test_not_connected_nodes():
-    with pytest.raises(nx.NetworkXNoPath):
-        G = nx.Graph()
-        nx.add_path(G, [1, 2, 3])
-        nx.add_path(G, [4, 5])
-        list(nx.node_disjoint_paths(G, 1, 5))
-
-
-def test_isolated_edges():
-    with pytest.raises(nx.NetworkXNoPath):
-        G = nx.Graph()
-        G.add_node(1)
-        nx.add_path(G, [4, 5])
-        list(nx.edge_disjoint_paths(G, 1, 5))
-
-
-def test_isolated_nodes():
-    with pytest.raises(nx.NetworkXNoPath):
-        G = nx.Graph()
-        G.add_node(1)
-        nx.add_path(G, [4, 5])
-        list(nx.node_disjoint_paths(G, 1, 5))
-
-
-def test_invalid_auxiliary():
-    with pytest.raises(nx.NetworkXError):
-        G = nx.complete_graph(5)
-        list(nx.node_disjoint_paths(G, 0, 3, auxiliary=G))