for n in n_list: # Generate a random Graph # 25% = 1 75% = 0 G = RandomGraph( n_vertex = n, unconnected_probability = 100000000 ) # if the adj_matrix have the main diag set to 1 # and s is 0 # BFS lowest queue -> DFS max stack ''' s = G.get_first_vertex() G.set_matrix_sub_diag_to_1() ''' # if all s column is set to 1 # DFS lowest stack -> BSF max queue s = G.get_random_source_S() G.set_matrix_column_to_1( s.get_key() ) G.show_adj_matrix() # Launch BFS to obtain a graph where all vertices are connected BFS( G, s ) # All the vetices that are unraggiungible from s are WHITE # So we delete them from G G.delete_white_vertices() # BEGIN THE TEST max_queue = BFS( G, s ) max_queue_list.append( max_queue ) max_stack = DFS_iterative( G, s ) max_stack_list.append( max_stack )
