原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
EUEd(Q, v) // v is now on the frontier 18 u.color = BLACK // u is now behind the frontier
The results of breadth-first search may depend upon the order in which the neighbors of a given vertex are visited in line 12: the breadth-first tree may vary, but the distances d computed by the algorithm do not. (See Exercise 20.2-5.)
A simple change allows the BFS procedure to terminate in many cases before the queue Q be
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea