← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

20 第20章 基本图算法

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

becomes a descendant of v in the depth-first forest. Therefore, (u, v) is a back edge. ▪

Theorem 20.12 TOPOLOGICAL-SORT produces a topological sort of the directed acyclic graph provided as its input. Proof Suppose that DFS is run on a given dag G = (V, E) to determine finish times for its vertices. It suffices to show that for

any pair of distinct vertices u, v ∈ V, if G contains an edge from u to v, then v.f < u.f

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea