okstra 0.114.0 → 0.115.0

package/runtime/python/okstra_vendor/networkx/algorithms/centrality/tests/test_betweenness_centrality.py

@@ -1,923 +0,0 @@
-import math
-
-import pytest
-
-import networkx as nx
-
-
-def weighted_G():
-    G = nx.Graph()
-    G.add_edge(0, 1, weight=3)
-    G.add_edge(0, 2, weight=2)
-    G.add_edge(0, 3, weight=6)
-    G.add_edge(0, 4, weight=4)
-    G.add_edge(1, 3, weight=5)
-    G.add_edge(1, 5, weight=5)
-    G.add_edge(2, 4, weight=1)
-    G.add_edge(3, 4, weight=2)
-    G.add_edge(3, 5, weight=1)
-    G.add_edge(4, 5, weight=4)
-    return G
-
-
-class TestBetweennessCentrality:
-    def test_K5(self):
-        """Betweenness centrality: K5"""
-        G = nx.complete_graph(5)
-        b = nx.betweenness_centrality(G, weight=None, normalized=False)
-        b_answer = {0: 0.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_K5_endpoints(self):
-        """Betweenness centrality: K5 endpoints"""
-        G = nx.complete_graph(5)
-        b = nx.betweenness_centrality(G, weight=None, normalized=False, endpoints=True)
-        b_answer = {0: 4.0, 1: 4.0, 2: 4.0, 3: 4.0, 4: 4.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-        # normalized = True case
-        b = nx.betweenness_centrality(G, weight=None, normalized=True, endpoints=True)
-        b_answer = {0: 0.4, 1: 0.4, 2: 0.4, 3: 0.4, 4: 0.4}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_P3_normalized(self):
-        """Betweenness centrality: P3 normalized"""
-        G = nx.path_graph(3)
-        b = nx.betweenness_centrality(G, weight=None, normalized=True)
-        b_answer = {0: 0.0, 1: 1.0, 2: 0.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_P3(self):
-        """Betweenness centrality: P3"""
-        G = nx.path_graph(3)
-        b_answer = {0: 0.0, 1: 1.0, 2: 0.0}
-        b = nx.betweenness_centrality(G, weight=None, normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_sample_from_P3(self):
-        """Betweenness centrality: P3 sample"""
-        G = nx.path_graph(3)
-        b_answer = {0: 0.0, 1: 1.0, 2: 0.0}
-        b = nx.betweenness_centrality(G, k=3, weight=None, normalized=False, seed=1)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-        b = nx.betweenness_centrality(G, k=2, weight=None, normalized=False, seed=1)
-        # python versions give different results with same seed
-        b_approx1 = {0: 0.0, 1: 1.0, 2: 0.0}
-        b_approx2 = {0: 0.0, 1: 0.5, 2: 0.0}
-        for n in sorted(G):
-            assert b[n] in (b_approx1[n], b_approx2[n])
-
-    def test_P3_endpoints(self):
-        """Betweenness centrality: P3 endpoints"""
-        G = nx.path_graph(3)
-        b_answer = {0: 2.0, 1: 3.0, 2: 2.0}
-        b = nx.betweenness_centrality(G, weight=None, normalized=False, endpoints=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-        # normalized = True case
-        b_answer = {0: 2 / 3, 1: 1.0, 2: 2 / 3}
-        b = nx.betweenness_centrality(G, weight=None, normalized=True, endpoints=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_krackhardt_kite_graph(self):
-        """Betweenness centrality: Krackhardt kite graph"""
-        G = nx.krackhardt_kite_graph()
-        b_answer = {
-            0: 1.667,
-            1: 1.667,
-            2: 0.000,
-            3: 7.333,
-            4: 0.000,
-            5: 16.667,
-            6: 16.667,
-            7: 28.000,
-            8: 16.000,
-            9: 0.000,
-        }
-        for b in b_answer:
-            b_answer[b] /= 2
-        b = nx.betweenness_centrality(G, weight=None, normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_krackhardt_kite_graph_normalized(self):
-        """Betweenness centrality: Krackhardt kite graph normalized"""
-        G = nx.krackhardt_kite_graph()
-        b_answer = {
-            0: 0.023,
-            1: 0.023,
-            2: 0.000,
-            3: 0.102,
-            4: 0.000,
-            5: 0.231,
-            6: 0.231,
-            7: 0.389,
-            8: 0.222,
-            9: 0.000,
-        }
-        b = nx.betweenness_centrality(G, weight=None, normalized=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_florentine_families_graph(self):
-        """Betweenness centrality: Florentine families graph"""
-        G = nx.florentine_families_graph()
-        b_answer = {
-            "Acciaiuoli": 0.000,
-            "Albizzi": 0.212,
-            "Barbadori": 0.093,
-            "Bischeri": 0.104,
-            "Castellani": 0.055,
-            "Ginori": 0.000,
-            "Guadagni": 0.255,
-            "Lamberteschi": 0.000,
-            "Medici": 0.522,
-            "Pazzi": 0.000,
-            "Peruzzi": 0.022,
-            "Ridolfi": 0.114,
-            "Salviati": 0.143,
-            "Strozzi": 0.103,
-            "Tornabuoni": 0.092,
-        }
-
-        b = nx.betweenness_centrality(G, weight=None, normalized=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_les_miserables_graph(self):
-        """Betweenness centrality: Les Miserables graph"""
-        G = nx.les_miserables_graph()
-        b_answer = {
-            "Napoleon": 0.000,
-            "Myriel": 0.177,
-            "MlleBaptistine": 0.000,
-            "MmeMagloire": 0.000,
-            "CountessDeLo": 0.000,
-            "Geborand": 0.000,
-            "Champtercier": 0.000,
-            "Cravatte": 0.000,
-            "Count": 0.000,
-            "OldMan": 0.000,
-            "Valjean": 0.570,
-            "Labarre": 0.000,
-            "Marguerite": 0.000,
-            "MmeDeR": 0.000,
-            "Isabeau": 0.000,
-            "Gervais": 0.000,
-            "Listolier": 0.000,
-            "Tholomyes": 0.041,
-            "Fameuil": 0.000,
-            "Blacheville": 0.000,
-            "Favourite": 0.000,
-            "Dahlia": 0.000,
-            "Zephine": 0.000,
-            "Fantine": 0.130,
-            "MmeThenardier": 0.029,
-            "Thenardier": 0.075,
-            "Cosette": 0.024,
-            "Javert": 0.054,
-            "Fauchelevent": 0.026,
-            "Bamatabois": 0.008,
-            "Perpetue": 0.000,
-            "Simplice": 0.009,
-            "Scaufflaire": 0.000,
-            "Woman1": 0.000,
-            "Judge": 0.000,
-            "Champmathieu": 0.000,
-            "Brevet": 0.000,
-            "Chenildieu": 0.000,
-            "Cochepaille": 0.000,
-            "Pontmercy": 0.007,
-            "Boulatruelle": 0.000,
-            "Eponine": 0.011,
-            "Anzelma": 0.000,
-            "Woman2": 0.000,
-            "MotherInnocent": 0.000,
-            "Gribier": 0.000,
-            "MmeBurgon": 0.026,
-            "Jondrette": 0.000,
-            "Gavroche": 0.165,
-            "Gillenormand": 0.020,
-            "Magnon": 0.000,
-            "MlleGillenormand": 0.048,
-            "MmePontmercy": 0.000,
-            "MlleVaubois": 0.000,
-            "LtGillenormand": 0.000,
-            "Marius": 0.132,
-            "BaronessT": 0.000,
-            "Mabeuf": 0.028,
-            "Enjolras": 0.043,
-            "Combeferre": 0.001,
-            "Prouvaire": 0.000,
-            "Feuilly": 0.001,
-            "Courfeyrac": 0.005,
-            "Bahorel": 0.002,
-            "Bossuet": 0.031,
-            "Joly": 0.002,
-            "Grantaire": 0.000,
-            "MotherPlutarch": 0.000,
-            "Gueulemer": 0.005,
-            "Babet": 0.005,
-            "Claquesous": 0.005,
-            "Montparnasse": 0.004,
-            "Toussaint": 0.000,
-            "Child1": 0.000,
-            "Child2": 0.000,
-            "Brujon": 0.000,
-            "MmeHucheloup": 0.000,
-        }
-
-        b = nx.betweenness_centrality(G, weight=None, normalized=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_ladder_graph(self):
-        """Betweenness centrality: Ladder graph"""
-        G = nx.Graph()  # ladder_graph(3)
-        G.add_edges_from([(0, 1), (0, 2), (1, 3), (2, 3), (2, 4), (4, 5), (3, 5)])
-        b_answer = {0: 1.667, 1: 1.667, 2: 6.667, 3: 6.667, 4: 1.667, 5: 1.667}
-        for b in b_answer:
-            b_answer[b] /= 2
-        b = nx.betweenness_centrality(G, weight=None, normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_disconnected_path(self):
-        """Betweenness centrality: disconnected path"""
-        G = nx.Graph()
-        nx.add_path(G, [0, 1, 2])
-        nx.add_path(G, [3, 4, 5, 6])
-        b_answer = {0: 0, 1: 1, 2: 0, 3: 0, 4: 2, 5: 2, 6: 0}
-        b = nx.betweenness_centrality(G, weight=None, normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_disconnected_path_endpoints(self):
-        """Betweenness centrality: disconnected path endpoints"""
-        G = nx.Graph()
-        nx.add_path(G, [0, 1, 2])
-        nx.add_path(G, [3, 4, 5, 6])
-        b_answer = {0: 2, 1: 3, 2: 2, 3: 3, 4: 5, 5: 5, 6: 3}
-        b = nx.betweenness_centrality(G, weight=None, normalized=False, endpoints=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-        # normalized = True case
-        b = nx.betweenness_centrality(G, weight=None, normalized=True, endpoints=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n] / 21, abs=1e-7)
-
-    def test_directed_path(self):
-        """Betweenness centrality: directed path"""
-        G = nx.DiGraph()
-        nx.add_path(G, [0, 1, 2])
-        b = nx.betweenness_centrality(G, weight=None, normalized=False)
-        b_answer = {0: 0.0, 1: 1.0, 2: 0.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_directed_path_normalized(self):
-        """Betweenness centrality: directed path normalized"""
-        G = nx.DiGraph()
-        nx.add_path(G, [0, 1, 2])
-        b = nx.betweenness_centrality(G, weight=None, normalized=True)
-        b_answer = {0: 0.0, 1: 0.5, 2: 0.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    @pytest.mark.parametrize(
-        ("normalized", "endpoints", "is_directed", "k", "expected"),
-        [
-            (True, True, True, None, {0: 1.0, 1: 0.4, 2: 0.4, 3: 0.4, 4: 0.4}),
-            (True, True, True, 1, {0: 1.0, 1: 1.0, 2: 0.25, 3: 0.25, 4: 0.25}),
-            (True, True, False, None, {0: 1.0, 1: 0.4, 2: 0.4, 3: 0.4, 4: 0.4}),
-            (True, True, False, 1, {0: 1.0, 1: 1.0, 2: 0.25, 3: 0.25, 4: 0.25}),
-            (True, False, True, None, {0: 1.0, 1: 0, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (True, False, True, 1, {0: 1.0, 1: math.nan, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (True, False, False, None, {0: 1.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (True, False, False, 1, {0: 1.0, 1: math.nan, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (False, True, True, None, {0: 20.0, 1: 8.0, 2: 8.0, 3: 8.0, 4: 8.0}),
-            (False, True, True, 1, {0: 20.0, 1: 20.0, 2: 5.0, 3: 5.0, 4: 5.0}),
-            (False, True, False, None, {0: 10.0, 1: 4.0, 2: 4.0, 3: 4.0, 4: 4.0}),
-            (False, True, False, 1, {0: 10.0, 1: 10.0, 2: 2.5, 3: 2.5, 4: 2.5}),
-            (False, False, True, None, {0: 12.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (False, False, True, 1, {0: 12.0, 1: math.nan, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (False, False, False, None, {0: 6.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0}),
-            (False, False, False, 1, {0: 6.0, 1: math.nan, 2: 0.0, 3: 0.0, 4: 0.0}),
-        ],
-    )
-    def test_scale_with_k_on_star_graph(
-        self, normalized, endpoints, is_directed, k, expected
-    ):
-        # seed=1 selects node 1 as the initial node when using k=1.
-        # Recall node 0 is the center of the star graph.
-        G = nx.star_graph(4)
-        if is_directed:
-            G = G.to_directed()
-        b = nx.betweenness_centrality(
-            G, k=k, seed=1, endpoints=endpoints, normalized=normalized
-        )
-        assert b == pytest.approx(expected, nan_ok=True)
-
-    @pytest.mark.parametrize(
-        ("normalized", "endpoints", "is_directed", "k", "expected"),
-        [
-            (
-                *(True, True, True, None),  # Use *() splatting for better autoformat
-                {0: 14 / 20, 1: 14 / 20, 2: 14 / 20, 3: 14 / 20, 4: 14 / 20},
-            ),
-            (
-                *(True, True, True, 3),
-                {0: 9 / 12, 1: 11 / 12, 2: 9 / 12, 3: 6 / 12, 4: 7 / 12},
-            ),
-            (
-                *(True, True, False, None),
-                {0: 10 / 20, 1: 10 / 20, 2: 10 / 20, 3: 10 / 20, 4: 10 / 20},
-            ),
-            (
-                *(True, True, False, 3),
-                {0: 8 / 12, 1: 7 / 12, 2: 4 / 12, 3: 4 / 12, 4: 7 / 12},
-            ),
-            (
-                *(True, False, True, None),
-                {0: 6 / 12, 1: 6 / 12, 2: 6 / 12, 3: 6 / 12, 4: 6 / 12},
-            ),
-            (
-                *(True, False, True, 3),
-                # Use 6 instead of 9 for denominator for source nodes 0, 1, and 4
-                {0: 3 / 6, 1: 5 / 6, 2: 6 / 9, 3: 3 / 9, 4: 1 / 6},
-            ),
-            (
-                *(True, False, False, None),
-                {0: 2 / 12, 1: 2 / 12, 2: 2 / 12, 3: 2 / 12, 4: 2 / 12},
-            ),
-            (
-                *(True, False, False, 3),
-                # Use 6 instead of 9 for denominator for source nodes 0, 1, and 4
-                {0: 2 / 6, 1: 1 / 6, 2: 1 / 9, 3: 1 / 9, 4: 1 / 6},
-            ),
-            (False, True, True, None, {0: 14, 1: 14, 2: 14, 3: 14, 4: 14}),
-            (
-                *(False, True, True, 3),
-                {0: 9 * 5 / 3, 1: 11 * 5 / 3, 2: 9 * 5 / 3, 3: 6 * 5 / 3, 4: 7 * 5 / 3},
-            ),
-            (False, True, False, None, {0: 5, 1: 5, 2: 5, 3: 5, 4: 5}),
-            (
-                *(False, True, False, 3),
-                {0: 8 * 5 / 6, 1: 7 * 5 / 6, 2: 4 * 5 / 6, 3: 4 * 5 / 6, 4: 7 * 5 / 6},
-            ),
-            (False, False, True, None, {0: 6, 1: 6, 2: 6, 3: 6, 4: 6}),
-            (
-                *(False, False, True, 3),
-                # Use 2 instead of 3 for denominator for source nodes 0, 1, and 4
-                {0: 3 * 4 / 2, 1: 5 * 4 / 2, 2: 6 * 4 / 3, 3: 3 * 4 / 3, 4: 1 * 4 / 2},
-            ),
-            (False, False, False, None, {0: 1, 1: 1, 2: 1, 3: 1, 4: 1}),
-            (
-                *(False, False, False, 3),
-                # Use 4 instead of 6 for denominator for source nodes 0, 1, and 4
-                {0: 2 * 4 / 4, 1: 1 * 4 / 4, 2: 1 * 4 / 6, 3: 1 * 4 / 6, 4: 1 * 4 / 4},
-            ),
-        ],
-    )
-    def test_scale_with_k_on_cycle_graph(
-        self, normalized, endpoints, is_directed, k, expected
-    ):
-        # seed=1 selects nodes 0, 1, and 4 as the initial nodes when using k=3.
-        G = nx.cycle_graph(5, create_using=nx.DiGraph if is_directed else nx.Graph)
-        b = nx.betweenness_centrality(
-            G, k=k, seed=1, endpoints=endpoints, normalized=normalized
-        )
-        assert b == pytest.approx(expected)
-
-    def test_k_out_of_bounds_raises(self):
-        G = nx.cycle_graph(4)
-        with pytest.raises(ValueError, match="larger"):
-            nx.betweenness_centrality(G, k=5)
-        with pytest.raises(ValueError, match="negative"):
-            nx.betweenness_centrality(G, k=-1)
-        with pytest.raises(ZeroDivisionError):
-            nx.betweenness_centrality(G, k=0)
-        with pytest.raises(ZeroDivisionError):
-            nx.betweenness_centrality(G, k=0, normalized=False)
-        # Test edge case: use full population when k == len(G)
-        # Should we warn or raise instead?
-        b1 = nx.betweenness_centrality(G, k=4, endpoints=False)
-        b2 = nx.betweenness_centrality(G, endpoints=False)
-        assert b1 == b2
-
-
-class TestWeightedBetweennessCentrality:
-    def test_K5(self):
-        """Weighted betweenness centrality: K5"""
-        G = nx.complete_graph(5)
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = {0: 0.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_P3_normalized(self):
-        """Weighted betweenness centrality: P3 normalized"""
-        G = nx.path_graph(3)
-        b = nx.betweenness_centrality(G, weight="weight", normalized=True)
-        b_answer = {0: 0.0, 1: 1.0, 2: 0.0}
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_P3(self):
-        """Weighted betweenness centrality: P3"""
-        G = nx.path_graph(3)
-        b_answer = {0: 0.0, 1: 1.0, 2: 0.0}
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_krackhardt_kite_graph(self):
-        """Weighted betweenness centrality: Krackhardt kite graph"""
-        G = nx.krackhardt_kite_graph()
-        b_answer = {
-            0: 1.667,
-            1: 1.667,
-            2: 0.000,
-            3: 7.333,
-            4: 0.000,
-            5: 16.667,
-            6: 16.667,
-            7: 28.000,
-            8: 16.000,
-            9: 0.000,
-        }
-        for b in b_answer:
-            b_answer[b] /= 2
-
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_krackhardt_kite_graph_normalized(self):
-        """Weighted betweenness centrality:
-        Krackhardt kite graph normalized
-        """
-        G = nx.krackhardt_kite_graph()
-        b_answer = {
-            0: 0.023,
-            1: 0.023,
-            2: 0.000,
-            3: 0.102,
-            4: 0.000,
-            5: 0.231,
-            6: 0.231,
-            7: 0.389,
-            8: 0.222,
-            9: 0.000,
-        }
-        b = nx.betweenness_centrality(G, weight="weight", normalized=True)
-
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_florentine_families_graph(self):
-        """Weighted betweenness centrality:
-        Florentine families graph"""
-        G = nx.florentine_families_graph()
-        b_answer = {
-            "Acciaiuoli": 0.000,
-            "Albizzi": 0.212,
-            "Barbadori": 0.093,
-            "Bischeri": 0.104,
-            "Castellani": 0.055,
-            "Ginori": 0.000,
-            "Guadagni": 0.255,
-            "Lamberteschi": 0.000,
-            "Medici": 0.522,
-            "Pazzi": 0.000,
-            "Peruzzi": 0.022,
-            "Ridolfi": 0.114,
-            "Salviati": 0.143,
-            "Strozzi": 0.103,
-            "Tornabuoni": 0.092,
-        }
-
-        b = nx.betweenness_centrality(G, weight="weight", normalized=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_les_miserables_graph(self):
-        """Weighted betweenness centrality: Les Miserables graph"""
-        G = nx.les_miserables_graph()
-        b_answer = {
-            "Napoleon": 0.000,
-            "Myriel": 0.177,
-            "MlleBaptistine": 0.000,
-            "MmeMagloire": 0.000,
-            "CountessDeLo": 0.000,
-            "Geborand": 0.000,
-            "Champtercier": 0.000,
-            "Cravatte": 0.000,
-            "Count": 0.000,
-            "OldMan": 0.000,
-            "Valjean": 0.454,
-            "Labarre": 0.000,
-            "Marguerite": 0.009,
-            "MmeDeR": 0.000,
-            "Isabeau": 0.000,
-            "Gervais": 0.000,
-            "Listolier": 0.000,
-            "Tholomyes": 0.066,
-            "Fameuil": 0.000,
-            "Blacheville": 0.000,
-            "Favourite": 0.000,
-            "Dahlia": 0.000,
-            "Zephine": 0.000,
-            "Fantine": 0.114,
-            "MmeThenardier": 0.046,
-            "Thenardier": 0.129,
-            "Cosette": 0.075,
-            "Javert": 0.193,
-            "Fauchelevent": 0.026,
-            "Bamatabois": 0.080,
-            "Perpetue": 0.000,
-            "Simplice": 0.001,
-            "Scaufflaire": 0.000,
-            "Woman1": 0.000,
-            "Judge": 0.000,
-            "Champmathieu": 0.000,
-            "Brevet": 0.000,
-            "Chenildieu": 0.000,
-            "Cochepaille": 0.000,
-            "Pontmercy": 0.023,
-            "Boulatruelle": 0.000,
-            "Eponine": 0.023,
-            "Anzelma": 0.000,
-            "Woman2": 0.000,
-            "MotherInnocent": 0.000,
-            "Gribier": 0.000,
-            "MmeBurgon": 0.026,
-            "Jondrette": 0.000,
-            "Gavroche": 0.285,
-            "Gillenormand": 0.024,
-            "Magnon": 0.005,
-            "MlleGillenormand": 0.036,
-            "MmePontmercy": 0.005,
-            "MlleVaubois": 0.000,
-            "LtGillenormand": 0.015,
-            "Marius": 0.072,
-            "BaronessT": 0.004,
-            "Mabeuf": 0.089,
-            "Enjolras": 0.003,
-            "Combeferre": 0.000,
-            "Prouvaire": 0.000,
-            "Feuilly": 0.004,
-            "Courfeyrac": 0.001,
-            "Bahorel": 0.007,
-            "Bossuet": 0.028,
-            "Joly": 0.000,
-            "Grantaire": 0.036,
-            "MotherPlutarch": 0.000,
-            "Gueulemer": 0.025,
-            "Babet": 0.015,
-            "Claquesous": 0.042,
-            "Montparnasse": 0.050,
-            "Toussaint": 0.011,
-            "Child1": 0.000,
-            "Child2": 0.000,
-            "Brujon": 0.002,
-            "MmeHucheloup": 0.034,
-        }
-
-        b = nx.betweenness_centrality(G, weight="weight", normalized=True)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_ladder_graph(self):
-        """Weighted betweenness centrality: Ladder graph"""
-        G = nx.Graph()  # ladder_graph(3)
-        G.add_edges_from([(0, 1), (0, 2), (1, 3), (2, 3), (2, 4), (4, 5), (3, 5)])
-        b_answer = {0: 1.667, 1: 1.667, 2: 6.667, 3: 6.667, 4: 1.667, 5: 1.667}
-        for b in b_answer:
-            b_answer[b] /= 2
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-3)
-
-    def test_G(self):
-        """Weighted betweenness centrality: G"""
-        G = weighted_G()
-        b_answer = {0: 2.0, 1: 0.0, 2: 4.0, 3: 3.0, 4: 4.0, 5: 0.0}
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_G2(self):
-        """Weighted betweenness centrality: G2"""
-        G = nx.DiGraph()
-        G.add_weighted_edges_from(
-            [
-                ("s", "u", 10),
-                ("s", "x", 5),
-                ("u", "v", 1),
-                ("u", "x", 2),
-                ("v", "y", 1),
-                ("x", "u", 3),
-                ("x", "v", 5),
-                ("x", "y", 2),
-                ("y", "s", 7),
-                ("y", "v", 6),
-            ]
-        )
-
-        b_answer = {"y": 5.0, "x": 5.0, "s": 4.0, "u": 2.0, "v": 2.0}
-
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_G3(self):
-        """Weighted betweenness centrality: G3"""
-        G = nx.MultiGraph(weighted_G())
-        es = list(G.edges(data=True))[::2]  # duplicate every other edge
-        G.add_edges_from(es)
-        b_answer = {0: 2.0, 1: 0.0, 2: 4.0, 3: 3.0, 4: 4.0, 5: 0.0}
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_G4(self):
-        """Weighted betweenness centrality: G4"""
-        G = nx.MultiDiGraph()
-        G.add_weighted_edges_from(
-            [
-                ("s", "u", 10),
-                ("s", "x", 5),
-                ("s", "x", 6),
-                ("u", "v", 1),
-                ("u", "x", 2),
-                ("v", "y", 1),
-                ("v", "y", 1),
-                ("x", "u", 3),
-                ("x", "v", 5),
-                ("x", "y", 2),
-                ("x", "y", 3),
-                ("y", "s", 7),
-                ("y", "v", 6),
-                ("y", "v", 6),
-            ]
-        )
-
-        b_answer = {"y": 5.0, "x": 5.0, "s": 4.0, "u": 2.0, "v": 2.0}
-
-        b = nx.betweenness_centrality(G, weight="weight", normalized=False)
-        for n in sorted(G):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-
-class TestEdgeBetweennessCentrality:
-    def test_K5(self):
-        """Edge betweenness centrality: K5"""
-        G = nx.complete_graph(5)
-        b = nx.edge_betweenness_centrality(G, weight=None, normalized=False)
-        b_answer = dict.fromkeys(G.edges(), 1)
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_normalized_K5(self):
-        """Edge betweenness centrality: K5"""
-        G = nx.complete_graph(5)
-        b = nx.edge_betweenness_centrality(G, weight=None, normalized=True)
-        b_answer = dict.fromkeys(G.edges(), 1 / 10)
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_C4(self):
-        """Edge betweenness centrality: C4"""
-        G = nx.cycle_graph(4)
-        b = nx.edge_betweenness_centrality(G, weight=None, normalized=True)
-        b_answer = {(0, 1): 2, (0, 3): 2, (1, 2): 2, (2, 3): 2}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n] / 6, abs=1e-7)
-
-    def test_P4(self):
-        """Edge betweenness centrality: P4"""
-        G = nx.path_graph(4)
-        b = nx.edge_betweenness_centrality(G, weight=None, normalized=False)
-        b_answer = {(0, 1): 3, (1, 2): 4, (2, 3): 3}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_normalized_P4(self):
-        """Edge betweenness centrality: P4"""
-        G = nx.path_graph(4)
-        b = nx.edge_betweenness_centrality(G, weight=None, normalized=True)
-        b_answer = {(0, 1): 3, (1, 2): 4, (2, 3): 3}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n] / 6, abs=1e-7)
-
-    def test_balanced_tree(self):
-        """Edge betweenness centrality: balanced tree"""
-        G = nx.balanced_tree(r=2, h=2)
-        b = nx.edge_betweenness_centrality(G, weight=None, normalized=False)
-        b_answer = {(0, 1): 12, (0, 2): 12, (1, 3): 6, (1, 4): 6, (2, 5): 6, (2, 6): 6}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_edge_betweenness_k(self):
-        """Ensure setting `k` properly limits the number of source nodes."""
-        G = nx.path_graph(3)
-        # This choice of `k` and `seed` selects nodes 0 and 2.
-        # There is only one shortest path between any two pairs of nodes.
-        # With source nodes 0 and 2, this means that both edges are part of
-        # three shortest paths:
-        # For (0, 1): sp(0, 1), sp(0, 2), sp(2, 0).
-        # For (1, 2): sp(0, 2), sp(2, 0), sp(2, 1).
-        # We normalize by 2 because the graph is undirected, and by
-        # `k / n = 2 / 3` because we are only considering a subset of source
-        # nodes.
-        # This means the final eb centralities should be 3 / 2 / (2 / 3) = 9 / 4.
-        eb = nx.edge_betweenness_centrality(G, k=2, seed=42, normalized=False)
-        assert eb == {(0, 1): 9 / 4, (1, 2): 9 / 4}
-        # When normalization is `True`, we instead divide by the number of total
-        # `(s, t)` pairs, i.e. `k * (n - 1) = 4`, meaning we get an eb of `3 / 4`.
-        eb = nx.edge_betweenness_centrality(G, k=2, seed=42, normalized=True)
-        assert eb == {(0, 1): 3 / 4, (1, 2): 3 / 4}
-
-
-class TestWeightedEdgeBetweennessCentrality:
-    def test_K5(self):
-        """Edge betweenness centrality: K5"""
-        G = nx.complete_graph(5)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = dict.fromkeys(G.edges(), 1)
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_C4(self):
-        """Edge betweenness centrality: C4"""
-        G = nx.cycle_graph(4)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = {(0, 1): 2, (0, 3): 2, (1, 2): 2, (2, 3): 2}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_P4(self):
-        """Edge betweenness centrality: P4"""
-        G = nx.path_graph(4)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = {(0, 1): 3, (1, 2): 4, (2, 3): 3}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_balanced_tree(self):
-        """Edge betweenness centrality: balanced tree"""
-        G = nx.balanced_tree(r=2, h=2)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = {(0, 1): 12, (0, 2): 12, (1, 3): 6, (1, 4): 6, (2, 5): 6, (2, 6): 6}
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_weighted_graph(self):
-        """Edge betweenness centrality: weighted"""
-        eList = [
-            (0, 1, 5),
-            (0, 2, 4),
-            (0, 3, 3),
-            (0, 4, 2),
-            (1, 2, 4),
-            (1, 3, 1),
-            (1, 4, 3),
-            (2, 4, 5),
-            (3, 4, 4),
-        ]
-        G = nx.Graph()
-        G.add_weighted_edges_from(eList)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = {
-            (0, 1): 0.0,
-            (0, 2): 1.0,
-            (0, 3): 2.0,
-            (0, 4): 1.0,
-            (1, 2): 2.0,
-            (1, 3): 3.5,
-            (1, 4): 1.5,
-            (2, 4): 1.0,
-            (3, 4): 0.5,
-        }
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_normalized_weighted_graph(self):
-        """Edge betweenness centrality: normalized weighted"""
-        eList = [
-            (0, 1, 5),
-            (0, 2, 4),
-            (0, 3, 3),
-            (0, 4, 2),
-            (1, 2, 4),
-            (1, 3, 1),
-            (1, 4, 3),
-            (2, 4, 5),
-            (3, 4, 4),
-        ]
-        G = nx.Graph()
-        G.add_weighted_edges_from(eList)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=True)
-        b_answer = {
-            (0, 1): 0.0,
-            (0, 2): 1.0,
-            (0, 3): 2.0,
-            (0, 4): 1.0,
-            (1, 2): 2.0,
-            (1, 3): 3.5,
-            (1, 4): 1.5,
-            (2, 4): 1.0,
-            (3, 4): 0.5,
-        }
-        norm = len(G) * (len(G) - 1) / 2
-        for n in sorted(G.edges()):
-            assert b[n] == pytest.approx(b_answer[n] / norm, abs=1e-7)
-
-    def test_weighted_multigraph(self):
-        """Edge betweenness centrality: weighted multigraph"""
-        eList = [
-            (0, 1, 5),
-            (0, 1, 4),
-            (0, 2, 4),
-            (0, 3, 3),
-            (0, 3, 3),
-            (0, 4, 2),
-            (1, 2, 4),
-            (1, 3, 1),
-            (1, 3, 2),
-            (1, 4, 3),
-            (1, 4, 4),
-            (2, 4, 5),
-            (3, 4, 4),
-            (3, 4, 4),
-        ]
-        G = nx.MultiGraph()
-        G.add_weighted_edges_from(eList)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=False)
-        b_answer = {
-            (0, 1, 0): 0.0,
-            (0, 1, 1): 0.5,
-            (0, 2, 0): 1.0,
-            (0, 3, 0): 0.75,
-            (0, 3, 1): 0.75,
-            (0, 4, 0): 1.0,
-            (1, 2, 0): 2.0,
-            (1, 3, 0): 3.0,
-            (1, 3, 1): 0.0,
-            (1, 4, 0): 1.5,
-            (1, 4, 1): 0.0,
-            (2, 4, 0): 1.0,
-            (3, 4, 0): 0.25,
-            (3, 4, 1): 0.25,
-        }
-        for n in sorted(G.edges(keys=True)):
-            assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
-
-    def test_normalized_weighted_multigraph(self):
-        """Edge betweenness centrality: normalized weighted multigraph"""
-        eList = [
-            (0, 1, 5),
-            (0, 1, 4),
-            (0, 2, 4),
-            (0, 3, 3),
-            (0, 3, 3),
-            (0, 4, 2),
-            (1, 2, 4),
-            (1, 3, 1),
-            (1, 3, 2),
-            (1, 4, 3),
-            (1, 4, 4),
-            (2, 4, 5),
-            (3, 4, 4),
-            (3, 4, 4),
-        ]
-        G = nx.MultiGraph()
-        G.add_weighted_edges_from(eList)
-        b = nx.edge_betweenness_centrality(G, weight="weight", normalized=True)
-        b_answer = {
-            (0, 1, 0): 0.0,
-            (0, 1, 1): 0.5,
-            (0, 2, 0): 1.0,
-            (0, 3, 0): 0.75,
-            (0, 3, 1): 0.75,
-            (0, 4, 0): 1.0,
-            (1, 2, 0): 2.0,
-            (1, 3, 0): 3.0,
-            (1, 3, 1): 0.0,
-            (1, 4, 0): 1.5,
-            (1, 4, 1): 0.0,
-            (2, 4, 0): 1.0,
-            (3, 4, 0): 0.25,
-            (3, 4, 1): 0.25,
-        }
-        norm = len(G) * (len(G) - 1) / 2
-        for n in sorted(G.edges(keys=True)):
-            assert b[n] == pytest.approx(b_answer[n] / norm, abs=1e-7)