原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
e Exercise 19.4-6.) ▪ Putting the preceding lemmas together yields the following theorem.
Theorem 19.14 A sequence of m MAKE-SET, UNION, and FIND-SET operations, n of which are MAKE-SET operations, can be performed on a disjoint-set forest with union by rank and path compression in O(m α(n)) time. Proof Immediate from Lemmas 19.7, 19.11, 19.12, and 19.13. ▪
Exercises 19.4-1 Prove Lemma 19.4. 19.4-2 Prove that every node has rank at most ⌊lg n⌋.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea