159 lines
6.9 KiB
Python
159 lines
6.9 KiB
Python
#!/usr/bin/env python
|
|
import pytest
|
|
np = pytest.importorskip('numpy')
|
|
scipy = 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
|
|
|
|
from networkx import edge_current_flow_betweenness_centrality_subset \
|
|
as edge_current_flow_subset
|
|
|
|
|
|
class TestFlowBetweennessCentrality(object):
|
|
|
|
def test_K4_normalized(self):
|
|
"""Betweenness centrality: K4"""
|
|
G = nx.complete_graph(4)
|
|
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])
|
|
|
|
def test_K4(self):
|
|
"""Betweenness centrality: K4"""
|
|
G = nx.complete_graph(4)
|
|
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])
|
|
# 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])
|
|
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])
|
|
b = nx.current_flow_betweenness_centrality_subset(G,
|
|
list(G),
|
|
list(G),
|
|
normalized=True,
|
|
weight='other')
|
|
b_answer = nx.current_flow_betweenness_centrality(G, normalized=True, weight='other')
|
|
for n in sorted(G):
|
|
assert almost_equal(b[n], b_answer[n])
|
|
|
|
def test_P4_normalized(self):
|
|
"""Betweenness centrality: P4 normalized"""
|
|
G = nx.path_graph(4)
|
|
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])
|
|
|
|
def test_P4(self):
|
|
"""Betweenness centrality: P4"""
|
|
G = nx.path_graph(4)
|
|
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])
|
|
|
|
def test_star(self):
|
|
"""Betweenness centrality: star """
|
|
G = nx.Graph()
|
|
nx.add_star(G, ['a', 'b', 'c', 'd'])
|
|
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])
|
|
|
|
|
|
# class TestWeightedFlowBetweennessCentrality():
|
|
# pass
|
|
|
|
|
|
class TestEdgeFlowBetweennessCentrality(object):
|
|
|
|
def test_K4_normalized(self):
|
|
"""Betweenness centrality: K4"""
|
|
G = nx.complete_graph(4)
|
|
b = edge_current_flow_subset(G, list(G), list(G), normalized=True)
|
|
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)
|
|
|
|
def test_K4(self):
|
|
"""Betweenness centrality: K4"""
|
|
G = nx.complete_graph(4)
|
|
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)
|
|
# 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)
|
|
|
|
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)
|
|
|
|
b = edge_current_flow_subset(G, list(G), list(G), normalized=False, weight='other')
|
|
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)
|
|
|
|
def test_C4(self):
|
|
"""Edge betweenness centrality: C4"""
|
|
G = nx.cycle_graph(4)
|
|
b = edge_current_flow_subset(G, list(G), list(G), normalized=True)
|
|
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)
|
|
|
|
def test_P4(self):
|
|
"""Edge betweenness centrality: P4"""
|
|
G = nx.path_graph(4)
|
|
b = edge_current_flow_subset(G, list(G), list(G), normalized=True)
|
|
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)
|