'Weighted betweenness centrality: Ladder graph'

def test_ladder_graph(self):

    G = nx.Graph()
    G.add_edges_from([(0, 1), (0, 2), (1, 3), (2, 3), (2, 4), (4, 5), (3, 5)])
    b_answer = {0: 1.667, 1: 1.667, 2: 6.667, 3: 6.667, 4: 1.667, 5: 1.667}
    for b in b_answer:
        b_answer[b] /= 2.0
    b = nx.betweenness_centrality(G, weight='weight', normalized=False)
    for n in sorted(G):
        assert_almost_equal(b[n], b_answer[n], places=3)
