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 of $G$, when $G$ is represented using adjacency matrix?
previous year
https://gateoverflow.in/1771/gate2014-1-11
64.3k questions
77.9k answers
244k comments
80.0k users