算法设计技巧与分析课件(英文版)：ch4 Heaps and the disjoint sets data structures.pptVIP

* * * * * * * * * * * * * * * * Algorithms Design Techniques and Analysis An example 2 4 6 8 9 1 3 5 7 UNION(4,8) Algorithms Design Techniques and Analysis An example 2 4 6 8 9 1 3 5 7 FIND(1) End Algorithms Design Techniques and Analysis 4.3.4 Analysis of the union-find algorithms Lemma 4.2 For any integer r?0, the number of nodes of rank r is at most n/2r. Proof: Fix a particular of r. When a node x is assigned a rank of r, label by x all the nodes contained in the tree rooted at x. By Lemma 4.1, the number of labeled nodes is at least 2r. If the root of that tree changed, then the