Consequences of DFS
Can determine if there is a path from v to w in O(n+e).
Can find a spanning tree of a connected graph in O(n+e).
Can be used to detect if graph is a tree or if it contains a cycle.
Can determine if the graph is connected.
Can find the connected components of the graph.