原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
s a breadth-first tree, initially containing only its root, which is the source vertex s.
Whenever the search discovers a white vertex v in the course of scanning the adjacency list of a gray vertex u, the vertex v and the edge (u, v) are added to the tree. We say that u is the predecessor or parent of v in the breadth-first tree.
Since every vertex reachable from s is discovered at most once, each vertex reachable fro
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea