原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
n which v.d < u.d is similar, with the roles of u and v reversed in the above argument. ▪
Corollary 20.8 (Nesting of descendants’ intervals) Vertex v is a proper descendant of vertex u in the depth-first forest for a (directed or undirected) graph G if and only if u.d < v.d < v.f < u.f.
Proof Immediate from Theorem 20.7. ▪ The next theorem gives another important characteriz
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea