原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
h-first search visits vertices of (GT)SCC in the reverse of a topologically sorted order.
If you reverse the edges of (GT)SCC, you get the graph ((GT)SCC)T. Because ((GT)SCC)T = GSCC (see Exercise 20.5-4), the second depth-first search visits the vertices of GSCC in topologically sorted order.
Exercises 20.5-1 How can the number of strongly connected components of a graph change if
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea