#NEWLINE# def test_digraph( self ) : #NEWLINE# #INDENT# G = nx . DiGraph ( ) #NEWLINE# G . add_path ( [ 1 , 2 , 3 ] ) #NEWLINE# H = adjacency_graph ( adjacency_data ( G ) ) #NEWLINE# assert_true ( H . is_directed ( ) ) #NEWLINE# nx . is_isomorphic ( G , H )