本文详细解释了深度优先搜索(DFS)算法，它在给定图G中按照特定顺序遍历，从最近访问的顶点u的未访问邻接节点v开始搜索，当顶点u的所有可能搜索路径都探索完毕时会回溯到之前的顶点。
Definition 1. (Depth-First Search) Given a graph G, a depth-first search (DFS) traverses G in a particular order by picking an unvisited vertex v from the out-neighbors ofthe most recently visited vertex u to search, and backtracks to the vertex from where it came when a vertex u has explored all possible ways to search further.
扫一扫
862
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
