原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
node x after q operations: We next investigate some useful properties of node potentials.
Lemma 19.8 For every node x, and for all operation counts q, we have 0 ≤ ϕq(x) ≤ α(n) · x.rank.
Proof If x is a root or x.rank = 0, then ϕq(x) = α(n) · x.rank by definition. Now suppose
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea