搜索算法-深度优先搜索.pdfVIP

TREEGRAPH DFSDFS DFS WHITE GRAY BLACK DFS(G, s) for 在图G中的每⼀个节点v status[v] = WHITE // 进⾏其他初始 DFS-VISIT(s) DFS-VISIT(v) status[v] = GRAY for 每⼀个v的邻接节点 if (status[v] == WHITE) DFS-VISIT(t) status[v] = BLACK stack DFS(G, s) stack visted, unvisited unvisited .push(s) while (!unvisited .empty()) // 只有当unvisted不空 current = unvisited .pop() for 每⼀个current的邻接节点v and 节点v不在visited中 // 在以上的图例中是按 从右向左的⽅式来遍历这些邻接节点 unvisited .push(v) visted .push(current) unvisted DFS(G, s, d) stack visted, unvisited unvisited .push(s) while (!unvisited .empty()) // 只有当unvisted不空 current = unvisited .pop() if (current == d) break; for 每⼀个current的邻接节点v and 节点不在visited中 // 在以上的图例中是按 从右向左的⽅式来遍历这些邻接节点 v .prev = current unvisited .push(v) visted .push(current) vprev DFS常常因为要搜索的图的某⼀条 搜索路径太⻓（甚⾄是⽆限的）⽽陷⼊性能瓶颈 DFS DFS(G, s, d) for 在图G中的每⼀个节点v status[v] = WHITE // 进⾏其他初始 for depth = 0 for max = 边数/2, 边数 do if DFS-VISIT(s, d, depth, max) break; DFS-VISIT(v, d, depth, max) if (depth width) return false if (v == d) return true status[v] = GRAY for 每⼀个v的邻接节点t if (status[t] == WHITE) t .prev = v DFS-VISIT(t, d, depth + 1, max) status[v] = BLACK return false step0 step A ~ F 66 “ ”“”