原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
t of each operation is its actual cost plus the change in potential due to the operation.
Lemma 19.11 The amortized cost of each MAKE-SET operation is O(1). Proof Suppose that the qth operation is MAKE-SET(x). This operation creates node x with rank 0, so that ϕq(x) = 0.
No other ranks or potentials change, and so Φq = Φq−1. Noting that the actual cost of the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea