Q. 21 Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?
(A) O(n)
(B) O(m+n)
(C) O(n2)
(D) O(mn)
Answer: (C)
Explanation:
Q. 21 Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?
(A) O(n)
(B) O(m+n)
(C) O(n2)
(D) O(mn)
Answer: (C)
Explanation:
