Let $G$ be a graph represented using adjacency matrix with $n$ vertices and $m$ edges. What is the tightest upper bound on the running time of depth-first search (DFS) on this graph?