#NEWLINE# def test_complete_graphs( ) : #NEWLINE# #INDENT# for n in range ( 5 , 20 , 5 ) : #NEWLINE# #INDENT# for flow_func in flow_funcs : #NEWLINE# #INDENT# G = nx . complete_graph ( n ) #NEWLINE# assert_equal ( ( n - 1 ) , nx . node_connectivity ( G , flow_func = flow_func ) , msg = msg . format ( flow_func . __name__ ) ) #NEWLINE# assert_equal ( ( n - 1 ) , nx . node_connectivity ( G . to_directed ( ) , flow_func = flow_func ) , msg = msg . format ( flow_func . __name__ ) ) #NEWLINE# assert_equal ( ( n - 1 ) , nx . edge_connectivity ( G , flow_func = flow_func ) , msg = msg . format ( flow_func . __name__ ) ) #NEWLINE# assert_equal ( ( n - 1 ) , nx . edge_connectivity ( G . to_directed ( ) , flow_func = flow_func ) , msg = msg . format ( flow_func . __name__ ) )