原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
reversed. Given an adjacency-list representation of G, the time to create GT is Θ(V + E).
The graphs G and GT have exactly the same strongly connected components: u and v are reachable from each other in G if and only if they are reachable from each other in GT. Figure 20.9(b) shows the transpose of the graph in Figure 20.9(a), with
the strongly connected components shaded blue in both parts. The linear-time (i.e., Θ(V +
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea