during dfs traversal on an undirected graph the algorithm builds a directed spanning tree which we call the dfs tree of the given graph (in a directed graph a dfs forest would be built).
during dfs traversal on an undirected graph the algorithm builds a directed spanning tree which we call the dfs tree of the given graph (in a directed graph a dfs forest would be built).