Mercurial > repos > shellac > sam_consensus_v3
view env/lib/python3.9/site-packages/networkx/algorithms/centrality/tests/test_voterank.py @ 0:4f3585e2f14b draft default tip
"planemo upload commit 60cee0fc7c0cda8592644e1aad72851dec82c959"
author | shellac |
---|---|
date | Mon, 22 Mar 2021 18:12:50 +0000 |
parents | |
children |
line wrap: on
line source
""" Unit tests for VoteRank. """ import networkx as nx class TestVoteRankCentrality: # Example Graph present in reference paper def test_voterank_centrality_1(self): G = nx.Graph() G.add_edges_from( [ (7, 8), (7, 5), (7, 9), (5, 0), (0, 1), (0, 2), (0, 3), (0, 4), (1, 6), (2, 6), (3, 6), (4, 6), ] ) assert [0, 7, 6] == nx.voterank(G) # Graph unit test def test_voterank_centrality_2(self): G = nx.florentine_families_graph() d = nx.voterank(G, 4) exact = ["Medici", "Strozzi", "Guadagni", "Castellani"] assert exact == d # DiGraph unit test def test_voterank_centrality_3(self): G = nx.gnc_graph(10, seed=7) d = nx.voterank(G, 4) exact = [3, 6, 8] assert exact == d # MultiGraph unit test def test_voterank_centrality_4(self): G = nx.MultiGraph() G.add_edges_from( [(0, 1), (0, 1), (1, 2), (2, 5), (2, 5), (5, 6), (5, 6), (2, 4), (4, 3)] ) exact = [2, 1, 5, 4] assert exact == nx.voterank(G) # MultiDiGraph unit test def test_voterank_centrality_5(self): G = nx.MultiDiGraph() G.add_edges_from( [(0, 1), (0, 1), (1, 2), (2, 5), (2, 5), (5, 6), (5, 6), (2, 4), (4, 3)] ) exact = [2, 0, 5, 4] assert exact == nx.voterank(G)