原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
t the parent of each vertex to NIL, and insert each vertex into the min-priority queue Q.
The algorithm maintains the following three-part loop invariant: Prior to each iteration of the while loop of lines 8–14, A = {(v, v.π) : v ∈ V – {r} – Q}. The vertices already placed into the minimum spanning tree are those
in V − Q. For all vertices v ∈ Q, if v.π ≠ NIL, then v.key < ∞ and v.key is the weight of
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea