原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
min-priority queue Q of all vertices that are not in the tree, based on a key attribute.
For each vertex v, the attribute v.key is the minimum weight of any edge connecting v to a vertex in the tree, where by convention, v.key = ∞ if there is no such edge. The attribute v.π names the parent of v in the tree. The
algorithm implicitly maintains the set A from GENERIC-MST as A = {(v, v.π) : v ∈ V – {r}
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea