原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
strongly connected component of G so that only a single vertex remains in each component.
STRONGLY-CONNECTED-COMPONENTS(G) 1 call DFS(G) to compute finish times u.f for each vertex u 2 create GT 3 call DFS(GT), but in the main loop of DFS, consider the vertices in order of decreasing u.f (as computed in line 1) 4 output the vertices of each tree in the depth-first forest formed in line 3 as a separate strongly connected component
The following lemma gives the key property that the component graph is acyclic. We’ll see
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea