19. Let G be a graph represented using adjacency matrix with n vertices and m cdges. What is the tightest upper bound on the running time of depth-first search (DFS) on this graph?
(A) 0(n)
(B) 0(m+n)
(C) 0(n²)
(D) 0(mn)

相關試題

相關試卷