原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
it has not yet been discovered, and the procedure discovers it by executing lines 14–17.
These lines paint vertex v gray, set v’s distance v.d to u.d + 1, record u as v’s parent v.π, and place v at the tail of the queue Q.
Once the procedure has examined all the vertices on u’s adjacency list, it blackens u in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea