原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
is invariant, in the sense that A ∪ {(u, v)} is also a subset of a minimum spanning tree.
We call such an edge a safe edge for A, since it can be added safely to A while maintaining the invariant. This generic algorithm uses the loop invariant as follows: Initialization: After line 1, the set A trivially satisfies the loop
invariant. Maintenance: The loop in lines 2–4 maintains the invariant by adding only safe
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea