# Bound the graph

Let $$G$$ be a graph of $$n$$ vertices and $$m$$ edges. If a depth first search is performed on $$G$$ what is the tightest upper bound of the running time?

Details and Assumptions

The graph is represented in adjacency matrix.

×