← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

20 第20章 基本图算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.720Z

3 u.π = NIL 4 time = 0 5 for each vertex u ∈ G.V 6 if u.color == WHITE 7 DFS-VISIT(G, u)

DFS-VISIT(G, u) 1 time = time + 1 // white vertex u has just been discovered 2 u.d = time 3 u.color = GRAY 4 for each vertex v in G.Adj[u] // explore each edge (u, v) 5 if v.color == WHITE 6 v.π = u 7 DFS-VISIT(G, v) 8 time = time + 1 9 u.f = time 10 u.color = BLACK // blacken u; it is finished

The DFS procedure works as follows. Lines 1–3 paint all vertices white and initialize the

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea