#NEWLINE# def test_is_eulerian2( self ) : #NEWLINE# #INDENT# G = nx . Graph ( ) #NEWLINE# G . add_nodes_from ( [ 1 , 2 , 3 ] ) #NEWLINE# assert_false ( is_eulerian ( G ) ) #NEWLINE# G = nx . DiGraph ( ) #NEWLINE# G . add_nodes_from ( [ 1 , 2 , 3 ] ) #NEWLINE# assert_false ( is_eulerian ( G ) ) #NEWLINE# G = nx . MultiDiGraph ( ) #NEWLINE# G . add_edge ( 1 , 2 ) #NEWLINE# G . add_edge ( 2 , 3 ) #NEWLINE# G . add_edge ( 2 , 3 ) #NEWLINE# G . add_edge ( 3 , 1 ) #NEWLINE# assert_false ( is_eulerian ( G ) )