原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
rstand how each operation can change the potential, we can determine the amortized costs.
Lemma 19.10 Let x be a node that is not a root, and suppose that the qth operation is either a LINK or a FIND-SET. Then after the qth operation, ϕq(x) ≤ ϕq−1(x). Moreover, if x.rank ≥ 1 and either level(x) or iter(x) changes due to the qth operation, then ϕq(x) ≤ ϕq−1(x) − 1.
That is, x’s potential cannot increase, and if it has positive rank and either level(x) o
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea