'Edge betweenness centrality: K5'

def test_K5(self):

    G = nx.complete_graph(5)
    b = nx.edge_betweenness_centrality_subset(G, sources=[0], targets=[1, 3], weight=None)
    b_answer = dict.fromkeys(G.edges(), 0)
    b_answer[(0, 3)] = b_answer[(0, 1)] = 0.5
    for n in sorted(G.edges()):
        assert_almost_equal(b[n], b_answer[n])
