原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
decreasing order of the finish times that were computed in the first depth-first search.
Lemma 20.13 Let C and C′ be distinct strongly connected components in directed graph G = (V, E), let u, v ∈ C, let u′, v′ ∈ C′, and suppose that G contains a path u ⇝ u′. Then G cannot also contain a path v′ ⇝ v. Proof If G contains a
path v′ ⇝ v, then it contains paths u ⇝ u′ ⇝ v′ and v′ ⇝ v ⇝ u. Thus, u and v′ are reacha
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea