#NEWLINE# def test_digraph_equality_edges( self ) : #NEWLINE# #INDENT# '\n        Digraph equality test. This one checks edge equality. \n        ' #NEWLINE# gr = digraph ( ) #NEWLINE# gr . add_nodes ( [ 0 , 1 , 2 , 3 , 4 ] ) #NEWLINE# gr . add_edge ( ( 0 , 1 ) , wt = 1 ) #NEWLINE# gr . add_edge ( ( 0 , 2 ) , wt = 2 ) #NEWLINE# gr . add_edge ( ( 1 , 2 ) , wt = 3 ) #NEWLINE# gr . add_edge ( ( 3 , 4 ) , wt = 4 ) #NEWLINE# gr2 = deepcopy ( gr ) #NEWLINE# gr3 = deepcopy ( gr ) #NEWLINE# gr3 . del_edge ( ( 0 , 2 ) ) #NEWLINE# gr4 = deepcopy ( gr ) #NEWLINE# gr4 . add_edge ( ( 2 , 4 ) ) #NEWLINE# gr5 = deepcopy ( gr ) #NEWLINE# gr5 . del_edge ( ( 0 , 2 ) ) #NEWLINE# gr5 . add_edge ( ( 2 , 4 ) ) #NEWLINE# gr6 = deepcopy ( gr ) #NEWLINE# gr6 . del_edge ( ( 0 , 2 ) ) #NEWLINE# gr6 . add_edge ( ( 0 , 2 ) , wt = 10 ) #NEWLINE# assert ( gr == gr2 ) #NEWLINE# assert ( gr2 == gr ) #NEWLINE# assert ( gr != gr3 ) #NEWLINE# assert ( gr3 != gr ) #NEWLINE# assert ( gr != gr4 ) #NEWLINE# assert ( gr4 != gr ) #NEWLINE# assert ( gr != gr5 ) #NEWLINE# assert ( gr5 != gr ) #NEWLINE# assert ( gr != gr6 ) #NEWLINE# assert ( gr6 != gr )