#NEWLINE# def test_white_harary_1( ) : #NEWLINE# #INDENT# G = nx . disjoint_union ( nx . complete_graph ( 4 ) , nx . complete_graph ( 4 ) ) #NEWLINE# G . remove_node ( 7 ) #NEWLINE# for i in range ( 4 , 7 ) : #NEWLINE# #INDENT# G . add_edge ( 0 , i ) #NEWLINE# #UNINDENT# G = nx . disjoint_union ( G , nx . complete_graph ( 4 ) ) #NEWLINE# G . remove_node ( ( G . order ( ) - 1 ) ) #NEWLINE# for i in range ( 7 , 10 ) : #NEWLINE# #INDENT# G . add_edge ( 0 , i ) #NEWLINE# #UNINDENT# for flow_func in flow_funcs : #NEWLINE# #INDENT# assert_equal ( 1 , nx . node_connectivity ( G , flow_func = i ) , msg = msg . format ( flow_func . __name__ ) ) #NEWLINE# assert_equal ( 3 , nx . edge_connectivity ( G , flow_func = flow_func ) , msg = msg . format ( flow_func . __name__ ) )