#NEWLINE# def test_path_graph( self ) : #NEWLINE# #INDENT# P10 = cnlti ( nx . path_graph ( 10 ) , first_label = 1 ) #NEWLINE# assert_equal ( list ( nx . edge_boundary ( P10 , [ ] ) ) , [ ] ) #NEWLINE# assert_equal ( list ( nx . edge_boundary ( P10 , [ ] , [ ] ) ) , [ ] ) #NEWLINE# assert_equal ( list ( nx . edge_boundary ( P10 , [ 1 , 2 , 3 ] ) ) , [ ( 3 , 4 ) ] ) #NEWLINE# assert_equal ( sorted ( nx . edge_boundary ( P10 , [ 4 , 5 , 6 ] ) ) , [ ( 4 , 3 ) , ( 6 , 7 ) ] ) #NEWLINE# assert_equal ( sorted ( nx . edge_boundary ( P10 , [ 3 , 4 , 5 , 6 , 7 ] ) ) , [ ( 3 , 2 ) , ( 7 , 8 ) ] ) #NEWLINE# assert_equal ( list ( nx . edge_boundary ( P10 , [ 8 , 9 , 10 ] ) ) , [ ( 8 , 7 ) ] ) #NEWLINE# assert_equal ( sorted ( nx . edge_boundary ( P10 , [ 4 , 5 , 6 ] , [ 9 , 10 ] ) ) , [ ] ) #NEWLINE# assert_equal ( list ( nx . edge_boundary ( P10 , [ 1 , 2 , 3 ] , [ 3 , 4 , 5 ] ) ) , [ ( 2 , 3 ) , ( 3 , 4 ) ] )