'Edge betweenness centrality: K5'

def test_K5(self):

    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_almost_equal(b[n], b_answer[n])
