algorithm - 什么是 DFS-Forest 组件？

Question

我知道深度优先搜索的工作原理以及实现方法，但我一直在我的教科书中看到 DFS-Forest 组件被引用，但我不完全确定它的含义。我知道图的一个组件是与其他组件断开连接的子图。那么什么是 DFS-Forest 组件呢？

Answer 1

根据 this University of Edinburgh's paper :

A DFS starting at some vertex v explores the graph by building up a tree that contains all vertices that are reachable from v and all edges that are used to reach these vertices. We call this tree a DFS tree. A complete DFS exploring the full graph (and not only the part reachable from a given vertex v) builds up a collection of trees, or forest, called a DFS forest.