GATE Computer Science (CS) 2014 Shift 1 Solved Paper

Question : 21 of 65

Marks: +1, -0

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?