'Betweenness centrality: Krackhardt kite graph'

def test_krackhardt_kite_graph(self):

    G = nx.krackhardt_kite_graph()
    b_answer = {0: 1.667, 1: 1.667, 2: 0.0, 3: 7.333, 4: 0.0, 5: 16.667, 6: 16.667, 7: 28.0, 8: 16.0, 9: 0.0}
    for b in b_answer:
        b_answer[b] /= 2.0
    b = nx.betweenness_centrality(G, weight=None, normalized=False)
    for n in sorted(G):
        assert_almost_equal(b[n], b_answer[n], places=3)
