原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
exactly one strongly connected component. The following theorem formalizes this argument.
Theorem 20.16 The STRONGLY-CONNECTED-COMPONENTS procedure correctly computes the strongly connected components of the directed graph G provided as its input. Proof We argue by induction on the number of depth-first trees found in the
depth-first search of GT in line 3 that the vertices of each tree form a strongly connect
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea