#NEWLINE# def test_shortest_path_on_graph( self ) : #NEWLINE# #INDENT# gr = testlib . new_graph ( wt_range = ( 1 , 10 ) ) #NEWLINE# ( st , dist ) = shortest_path ( dist , 0 ) #NEWLINE# for each in gr : #NEWLINE# #INDENT# if ( each in dist ) : #NEWLINE# #INDENT# assert bf_path ( gr , 0 , each , dist [ each ] )