原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
relating strongly connected components and finish times in the first depth-first search.
Lemma 20.14 Let C and C′ be distinct strongly connected components in directed graph G = (V, E). Suppose that there is an edge (u, v) ∈ E, where u ∈ C′ and v ∈ C. Then f(C′) > f(C). Proof We consider two cases, depending on which
strongly connected component, C or C′, had the first discovered vertex during the first d
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea