Description: Let undirected graph G with n vertices e edges, G to write algorithms to establish the adjacency table, and depth-first search in accordance with the output vertex requires time complexity of the algorithm is O (n+e), and in addition to the space occupied by the adjacent multi-table itself outside only O (1) auxiliary space.
To Search:
File list (Check if you may need any files):
4.cpp
Download