DFS and Spanning Trees
When running Depth-First Search on a graph, a spanning tree that is rooted at the algorithm’s start node, $s$ is formed. This tree is guranteed to be spanning the whole connected component that $s$ is in.
Search
When running Depth-First Search on a graph, a spanning tree that is rooted at the algorithm’s start node, $s$ is formed. This tree is guranteed to be spanning the whole connected component that $s$ is in.