okstra 0.113.0 → 0.115.0

package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_louvain.py

@@ -1,264 +0,0 @@
-import pytest
-
-import networkx as nx
-
-
-def test_modularity_increase():
-    G = nx.LFR_benchmark_graph(
-        250, 3, 1.5, 0.009, average_degree=5, min_community=20, seed=10
-    )
-    partition = [{u} for u in G.nodes()]
-    mod = nx.community.modularity(G, partition)
-    partition = nx.community.louvain_communities(G)
-
-    assert nx.community.modularity(G, partition) > mod
-
-
-def test_valid_partition():
-    G = nx.LFR_benchmark_graph(
-        250, 3, 1.5, 0.009, average_degree=5, min_community=20, seed=10
-    )
-    H = G.to_directed()
-    partition = nx.community.louvain_communities(G)
-    partition2 = nx.community.louvain_communities(H)
-
-    assert nx.community.is_partition(G, partition)
-    assert nx.community.is_partition(H, partition2)
-
-
-def test_karate_club_partition():
-    G = nx.karate_club_graph()
-    part = [
-        {0, 1, 2, 3, 7, 9, 11, 12, 13, 17, 19, 21},
-        {16, 4, 5, 6, 10},
-        {23, 25, 27, 28, 24, 31},
-        {32, 33, 8, 14, 15, 18, 20, 22, 26, 29, 30},
-    ]
-    partition = nx.community.louvain_communities(G, seed=2, weight=None)
-
-    assert part == partition
-
-
-def test_partition_iterator():
-    G = nx.path_graph(15)
-    parts_iter = nx.community.louvain_partitions(G, seed=42)
-    first_part = next(parts_iter)
-    first_copy = [s.copy() for s in first_part]
-
-    # gh-5901 reports sets changing after next partition is yielded
-    assert first_copy[0] == first_part[0]
-    second_part = next(parts_iter)
-    assert first_copy[0] == first_part[0]
-
-
-def test_undirected_selfloops():
-    G = nx.karate_club_graph()
-    expected_partition = nx.community.louvain_communities(G, seed=2, weight=None)
-    part = [
-        {0, 1, 2, 3, 7, 9, 11, 12, 13, 17, 19, 21},
-        {16, 4, 5, 6, 10},
-        {23, 25, 27, 28, 24, 31},
-        {32, 33, 8, 14, 15, 18, 20, 22, 26, 29, 30},
-    ]
-    assert expected_partition == part
-
-    G.add_weighted_edges_from([(i, i, i * 1000) for i in range(9)])
-    # large self-loop weight impacts partition
-    partition = nx.community.louvain_communities(G, seed=2, weight="weight")
-    assert part != partition
-
-    # small self-loop weights aren't enough to impact partition in this graph
-    partition = nx.community.louvain_communities(G, seed=2, weight=None)
-    assert part == partition
-
-
-def test_directed_selfloops():
-    G = nx.DiGraph()
-    G.add_nodes_from(range(11))
-    G_edges = [
-        (0, 2),
-        (0, 1),
-        (1, 0),
-        (2, 1),
-        (2, 0),
-        (3, 4),
-        (4, 3),
-        (7, 8),
-        (8, 7),
-        (9, 10),
-        (10, 9),
-    ]
-    G.add_edges_from(G_edges)
-    G_expected_partition = nx.community.louvain_communities(G, seed=123, weight=None)
-
-    G.add_weighted_edges_from([(i, i, i * 1000) for i in range(3)])
-    # large self-loop weight impacts partition
-    G_partition = nx.community.louvain_communities(G, seed=123, weight="weight")
-    assert G_partition != G_expected_partition
-
-    # small self-loop weights aren't enough to impact partition in this graph
-    G_partition = nx.community.louvain_communities(G, seed=123, weight=None)
-    assert G_partition == G_expected_partition
-
-
-def test_directed_partition():
-    """
-    Test 2 cases that were looping infinitely
-    from issues #5175 and #5704
-    """
-    G = nx.DiGraph()
-    H = nx.DiGraph()
-    G.add_nodes_from(range(10))
-    H.add_nodes_from([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])
-    G_edges = [
-        (0, 2),
-        (0, 1),
-        (1, 0),
-        (2, 1),
-        (2, 0),
-        (3, 4),
-        (4, 3),
-        (7, 8),
-        (8, 7),
-        (9, 10),
-        (10, 9),
-    ]
-    H_edges = [
-        (1, 2),
-        (1, 6),
-        (1, 9),
-        (2, 3),
-        (2, 4),
-        (2, 5),
-        (3, 4),
-        (4, 3),
-        (4, 5),
-        (5, 4),
-        (6, 7),
-        (6, 8),
-        (9, 10),
-        (9, 11),
-        (10, 11),
-        (11, 10),
-    ]
-    G.add_edges_from(G_edges)
-    H.add_edges_from(H_edges)
-
-    G_expected_partition = [{0, 1, 2}, {3, 4}, {5}, {6}, {8, 7}, {9, 10}]
-    G_partition = nx.community.louvain_communities(G, seed=123, weight=None)
-
-    H_expected_partition = [{2, 3, 4, 5}, {8, 1, 6, 7}, {9, 10, 11}]
-    H_partition = nx.community.louvain_communities(H, seed=123, weight=None)
-
-    assert G_partition == G_expected_partition
-    assert H_partition == H_expected_partition
-
-
-def test_none_weight_param():
-    G = nx.karate_club_graph()
-    nx.set_edge_attributes(
-        G, {edge: i * i for i, edge in enumerate(G.edges)}, name="foo"
-    )
-
-    part = [
-        {0, 1, 2, 3, 7, 9, 11, 12, 13, 17, 19, 21},
-        {16, 4, 5, 6, 10},
-        {23, 25, 27, 28, 24, 31},
-        {32, 33, 8, 14, 15, 18, 20, 22, 26, 29, 30},
-    ]
-    partition1 = nx.community.louvain_communities(G, weight=None, seed=2)
-    partition2 = nx.community.louvain_communities(G, weight="foo", seed=2)
-    partition3 = nx.community.louvain_communities(G, weight="weight", seed=2)
-
-    assert part == partition1
-    assert part != partition2
-    assert part != partition3
-    assert partition2 != partition3
-
-
-def test_quality():
-    G = nx.LFR_benchmark_graph(
-        250, 3, 1.5, 0.009, average_degree=5, min_community=20, seed=10
-    )
-    H = nx.gn_graph(200, seed=1234)
-    I = nx.MultiGraph(G)
-    J = nx.MultiDiGraph(H)
-
-    partition = nx.community.louvain_communities(G)
-    partition2 = nx.community.louvain_communities(H)
-    partition3 = nx.community.louvain_communities(I)
-    partition4 = nx.community.louvain_communities(J)
-
-    quality = nx.community.partition_quality(G, partition)[0]
-    quality2 = nx.community.partition_quality(H, partition2)[0]
-    quality3 = nx.community.partition_quality(I, partition3)[0]
-    quality4 = nx.community.partition_quality(J, partition4)[0]
-
-    assert quality >= 0.65
-    assert quality2 >= 0.65
-    assert quality3 >= 0.65
-    assert quality4 >= 0.65
-
-
-def test_multigraph():
-    G = nx.karate_club_graph()
-    H = nx.MultiGraph(G)
-    G.add_edge(0, 1, weight=10)
-    H.add_edge(0, 1, weight=9)
-    G.add_edge(0, 9, foo=20)
-    H.add_edge(0, 9, foo=20)
-
-    partition1 = nx.community.louvain_communities(G, seed=1234)
-    partition2 = nx.community.louvain_communities(H, seed=1234)
-    partition3 = nx.community.louvain_communities(H, weight="foo", seed=1234)
-
-    assert partition1 == partition2 != partition3
-
-
-def test_resolution():
-    G = nx.LFR_benchmark_graph(
-        250, 3, 1.5, 0.009, average_degree=5, min_community=20, seed=10
-    )
-
-    partition1 = nx.community.louvain_communities(G, resolution=0.5, seed=12)
-    partition2 = nx.community.louvain_communities(G, seed=12)
-    partition3 = nx.community.louvain_communities(G, resolution=2, seed=12)
-
-    assert len(partition1) <= len(partition2) <= len(partition3)
-
-
-def test_threshold():
-    G = nx.LFR_benchmark_graph(
-        250, 3, 1.5, 0.009, average_degree=5, min_community=20, seed=10
-    )
-    partition1 = nx.community.louvain_communities(G, threshold=0.3, seed=2)
-    partition2 = nx.community.louvain_communities(G, seed=2)
-    mod1 = nx.community.modularity(G, partition1)
-    mod2 = nx.community.modularity(G, partition2)
-
-    assert mod1 <= mod2
-
-
-def test_empty_graph():
-    G = nx.Graph()
-    G.add_nodes_from(range(5))
-    expected = [{0}, {1}, {2}, {3}, {4}]
-    assert nx.community.louvain_communities(G) == expected
-
-
-def test_max_level():
-    G = nx.LFR_benchmark_graph(
-        250, 3, 1.5, 0.009, average_degree=5, min_community=20, seed=10
-    )
-    parts_iter = nx.community.louvain_partitions(G, seed=42)
-    for max_level, expected in enumerate(parts_iter, 1):
-        partition = nx.community.louvain_communities(G, max_level=max_level, seed=42)
-        assert partition == expected
-    assert max_level > 1  # Ensure we are actually testing max_level
-    # max_level is an upper limit; it's okay if we stop before it's hit.
-    partition = nx.community.louvain_communities(G, max_level=max_level + 1, seed=42)
-    assert partition == expected
-    with pytest.raises(
-        ValueError, match="max_level argument must be a positive integer"
-    ):
-        nx.community.louvain_communities(G, max_level=0)

package/runtime/python/okstra_vendor/networkx/algorithms/community/tests/test_lukes.py

@@ -1,152 +0,0 @@
-from itertools import product
-
-import pytest
-
-import networkx as nx
-
-EWL = "e_weight"
-NWL = "n_weight"
-
-
-# first test from the Lukes original paper
-def paper_1_case(float_edge_wt=False, explicit_node_wt=True, directed=False):
-    # problem-specific constants
-    limit = 3
-
-    # configuration
-    if float_edge_wt:
-        shift = 0.001
-    else:
-        shift = 0
-
-    if directed:
-        example_1 = nx.DiGraph()
-    else:
-        example_1 = nx.Graph()
-
-    # graph creation
-    example_1.add_edge(1, 2, **{EWL: 3 + shift})
-    example_1.add_edge(1, 4, **{EWL: 2 + shift})
-    example_1.add_edge(2, 3, **{EWL: 4 + shift})
-    example_1.add_edge(2, 5, **{EWL: 6 + shift})
-
-    # node weights
-    if explicit_node_wt:
-        nx.set_node_attributes(example_1, 1, NWL)
-        wtu = NWL
-    else:
-        wtu = None
-
-    # partitioning
-    clusters_1 = {
-        frozenset(x)
-        for x in nx.community.lukes_partitioning(
-            example_1, limit, node_weight=wtu, edge_weight=EWL
-        )
-    }
-
-    return clusters_1
-
-
-# second test from the Lukes original paper
-def paper_2_case(explicit_edge_wt=True, directed=False):
-    # problem specific constants
-    byte_block_size = 32
-
-    # configuration
-    if directed:
-        example_2 = nx.DiGraph()
-    else:
-        example_2 = nx.Graph()
-
-    if explicit_edge_wt:
-        edic = {EWL: 1}
-        wtu = EWL
-    else:
-        edic = {}
-        wtu = None
-
-    # graph creation
-    example_2.add_edge("name", "home_address", **edic)
-    example_2.add_edge("name", "education", **edic)
-    example_2.add_edge("education", "bs", **edic)
-    example_2.add_edge("education", "ms", **edic)
-    example_2.add_edge("education", "phd", **edic)
-    example_2.add_edge("name", "telephone", **edic)
-    example_2.add_edge("telephone", "home", **edic)
-    example_2.add_edge("telephone", "office", **edic)
-    example_2.add_edge("office", "no1", **edic)
-    example_2.add_edge("office", "no2", **edic)
-
-    example_2.nodes["name"][NWL] = 20
-    example_2.nodes["education"][NWL] = 10
-    example_2.nodes["bs"][NWL] = 1
-    example_2.nodes["ms"][NWL] = 1
-    example_2.nodes["phd"][NWL] = 1
-    example_2.nodes["home_address"][NWL] = 8
-    example_2.nodes["telephone"][NWL] = 8
-    example_2.nodes["home"][NWL] = 8
-    example_2.nodes["office"][NWL] = 4
-    example_2.nodes["no1"][NWL] = 1
-    example_2.nodes["no2"][NWL] = 1
-
-    # partitioning
-    clusters_2 = {
-        frozenset(x)
-        for x in nx.community.lukes_partitioning(
-            example_2, byte_block_size, node_weight=NWL, edge_weight=wtu
-        )
-    }
-
-    return clusters_2
-
-
-def test_paper_1_case():
-    ground_truth = {frozenset([1, 4]), frozenset([2, 3, 5])}
-
-    tf = (True, False)
-    for flt, nwt, drc in product(tf, tf, tf):
-        part = paper_1_case(flt, nwt, drc)
-        assert part == ground_truth
-
-
-def test_paper_2_case():
-    ground_truth = {
-        frozenset(["education", "bs", "ms", "phd"]),
-        frozenset(["name", "home_address"]),
-        frozenset(["telephone", "home", "office", "no1", "no2"]),
-    }
-
-    tf = (True, False)
-    for ewt, drc in product(tf, tf):
-        part = paper_2_case(ewt, drc)
-        assert part == ground_truth
-
-
-def test_mandatory_tree():
-    not_a_tree = nx.complete_graph(4)
-
-    with pytest.raises(nx.NotATree):
-        nx.community.lukes_partitioning(not_a_tree, 5)
-
-
-def test_mandatory_integrality():
-    byte_block_size = 32
-
-    ex_1_broken = nx.DiGraph()
-
-    ex_1_broken.add_edge(1, 2, **{EWL: 3.2})
-    ex_1_broken.add_edge(1, 4, **{EWL: 2.4})
-    ex_1_broken.add_edge(2, 3, **{EWL: 4.0})
-    ex_1_broken.add_edge(2, 5, **{EWL: 6.3})
-
-    ex_1_broken.nodes[1][NWL] = 1.2  # !
-    ex_1_broken.nodes[2][NWL] = 1
-    ex_1_broken.nodes[3][NWL] = 1
-    ex_1_broken.nodes[4][NWL] = 1
-    ex_1_broken.nodes[5][NWL] = 2
-
-    with pytest.raises(TypeError):
-        nx.community.lukes_partitioning(
-            ex_1_broken, byte_block_size, node_weight=NWL, edge_weight=EWL
-        )