原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
no such edge (u, v) ∈ E, then there is no edge (v, u) ∈ ET such that u ∈ C′ and v ∈ C. ▪
Corollary 20.15 provides the key to understanding why the strongly connected components algorithm works. Let’s examine what happens during the second depth-first search, which is on GT. The search starts from the vertex x whose finish
time from the first depth-first search is maximum. This vertex belongs to some strongly c
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea