原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
or increases y’s rank by 1. Therefore, either ϕq(y) = ϕq−1(y) or ϕq(y) = ϕq−1(y) + α(n).
The increase in potential due to the LINK operation, therefore, is at most α(n). The amortized cost of the LINK operation is O(1) + α(n) = O(α(n)). ▪
Lemma 19.13 The amortized cost of each FIND-SET operation is O(α(n)). Proof Suppose that
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea