Let \(G\) be a graph with \(n\) vertices and \(m\) edges. What is the tightest…
GATE · 2014 · CS · Set 1 · Computer Science & IT
Let be a graph with vertices and edges. What is the tightest upper bound on the running time of Depth First Search on , when is represented as an adjacency matrix?
- A.
- B.
- C.
- D.
Attempted by 873 students.
Sign up free to check your answer
Sign up freeLoading lesson…