#NEWLINE# def test_K5( self ) : #NEWLINE# #INDENT# 'Edge betweenness centrality: K5' #NEWLINE# G = nx . complete_graph ( 5 ) #NEWLINE# b = nx . edge_betweenness_centrality ( G , weight = None , normalized = False ) #NEWLINE# b_answer = dict . fromkeys ( G . edges ( ) , 1 ) #NEWLINE# for n in sorted ( G . edges ( ) ) : #NEWLINE# #INDENT# assert_almost_equal ( b [ n ] , b_answer [ n ] )