原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
algorithm, we start with the following key lemma characterizing directed acyclic graphs.
Lemma 20.11 A directed graph G is acyclic if and only if a depth-first search of G yields no back edges. Figure 20.7 (a) Professor Bumstead topologically sorts his clothing when getting dressed. Each directed edge (u, v) means that garment u
must be put on before garment v. The discovery and finish times from a depth-first search
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea