原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
d that the find path contains s nodes. The actual cost of the FIND-SET operation is O(s).
We will show that no node’s potential increases due to the FIND-SET and that at least max {0, s − (α(n) + 2)} nodes on the find path have their potential decrease by at least 1.
We first show that no node’s potential increases. Lemma 19.10 takes care of all nodes oth
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea