diff options
Diffstat (limited to 'networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py')
| -rw-r--r-- | networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py | 31 |
1 files changed, 15 insertions, 16 deletions
diff --git a/networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py b/networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py index 47e41b3f..ae5a730f 100644 --- a/networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py +++ b/networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py @@ -4,7 +4,6 @@ pytest.importorskip("numpy") pytest.importorskip("scipy") import networkx as nx -from networkx.testing import almost_equal from networkx import edge_current_flow_betweenness_centrality as edge_current_flow @@ -22,7 +21,7 @@ class TestFlowBetweennessCentrality: ) b_answer = nx.current_flow_betweenness_centrality(G, normalized=True) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) def test_K4(self): """Betweenness centrality: K4""" @@ -32,20 +31,20 @@ class TestFlowBetweennessCentrality: ) b_answer = nx.current_flow_betweenness_centrality(G, normalized=True) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) # test weighted network G.add_edge(0, 1, weight=0.5, other=0.3) b = nx.current_flow_betweenness_centrality_subset( G, list(G), list(G), normalized=True, weight=None ) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) b = nx.current_flow_betweenness_centrality_subset( G, list(G), list(G), normalized=True ) b_answer = nx.current_flow_betweenness_centrality(G, normalized=True) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) b = nx.current_flow_betweenness_centrality_subset( G, list(G), list(G), normalized=True, weight="other" ) @@ -53,7 +52,7 @@ class TestFlowBetweennessCentrality: G, normalized=True, weight="other" ) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) def test_P4_normalized(self): """Betweenness centrality: P4 normalized""" @@ -63,7 +62,7 @@ class TestFlowBetweennessCentrality: ) b_answer = nx.current_flow_betweenness_centrality(G, normalized=True) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) def test_P4(self): """Betweenness centrality: P4""" @@ -73,7 +72,7 @@ class TestFlowBetweennessCentrality: ) b_answer = nx.current_flow_betweenness_centrality(G, normalized=True) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) def test_star(self): """Betweenness centrality: star""" @@ -84,7 +83,7 @@ class TestFlowBetweennessCentrality: ) b_answer = nx.current_flow_betweenness_centrality(G, normalized=True) for n in sorted(G): - assert almost_equal(b[n], b_answer[n]) + assert b[n] == pytest.approx(b_answer[n], abs=1e-7) # class TestWeightedFlowBetweennessCentrality(): @@ -99,7 +98,7 @@ class TestEdgeFlowBetweennessCentrality: b_answer = edge_current_flow(G, normalized=True) for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) def test_K4(self): """Betweenness centrality: K4""" @@ -108,20 +107,20 @@ class TestEdgeFlowBetweennessCentrality: b_answer = edge_current_flow(G, normalized=False) for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) # test weighted network G.add_edge(0, 1, weight=0.5, other=0.3) b = edge_current_flow_subset(G, list(G), list(G), normalized=False, weight=None) # weight is None => same as unweighted network for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) b = edge_current_flow_subset(G, list(G), list(G), normalized=False) b_answer = edge_current_flow(G, normalized=False) for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) b = edge_current_flow_subset( G, list(G), list(G), normalized=False, weight="other" @@ -129,7 +128,7 @@ class TestEdgeFlowBetweennessCentrality: b_answer = edge_current_flow(G, normalized=False, weight="other") for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) def test_C4(self): """Edge betweenness centrality: C4""" @@ -138,7 +137,7 @@ class TestEdgeFlowBetweennessCentrality: b_answer = edge_current_flow(G, normalized=True) for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) def test_P4(self): """Edge betweenness centrality: P4""" @@ -147,4 +146,4 @@ class TestEdgeFlowBetweennessCentrality: b_answer = edge_current_flow(G, normalized=True) for (s, t), v1 in b_answer.items(): v2 = b.get((s, t), b.get((t, s))) - assert almost_equal(v1, v2) + assert v1 == pytest.approx(v2, abs=1e-7) |