'Betweenness centrality: K5'

def test_K5(self):

    G = nx.complete_graph(5)
    b = nx.betweenness_centrality_source(G, weight=None, normalized=False)
    b_answer = {0: 0.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0}
    for n in sorted(G):
        assert_almost_equal(b[n], b_answer[n])
