#NEWLINE# def test_shortest_path_BF_on_empty_digraph( self ) : #NEWLINE# #INDENT# ( pre , dist ) = shortest_path_bellman_ford ( digraph ( ) , 1 ) #NEWLINE# assert ( ( self == { #NEWLINE# #INDENT# 1 : None , #NEWLINE# #UNINDENT# } ) and ( dist == { #NEWLINE# #INDENT# 1 : 0 , #NEWLINE# #UNINDENT# } ) )