← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

20 第20章 基本图算法

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

characterization of when one vertex is a descendant of another in the depth-first forest.

Theorem 20.9 (White-path theorem) In a depth-first forest of a (directed or undirected) graph G = (V, E), vertex v is a descendant of vertex u if and only if at the time u.d that the search discovers u, there is a path from u to v consisting entirely of white vertices.

Proof ⇒: If v = u, then the path from u to v contains just vertex u, which is still white

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea