第四讲堆和不相交集数据结构 算法设计与分析课件.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Algorithms Design Techniques and Analysis 例子 设S={1,2,…,9}，考虑用下面的合并和寻找序列：UNION(1,2), UNION(3,4), UNION(5,6), UNION(7,8), UNION(2,4), UNION(8,9), UNION(6,8), FIND(5), UNION(4,8), FIND(1)。 Algorithms Design Techniques and Analysis 例子 2 4 6 8 9 1 3 5 7 UNION(3,4) UNION(5,6) UNION(7,8) S{1,2,3,4,5,6,7,8,9} UNION(1,2) Algorithms Design Techniques and Analysis 例子 2 4 6 8 9 1 3 5 7 UNION(2,4) UNION(8,9) UNION(6,8) Algorithms Design Techniques and Analysis 例子 2 4 6 8 9 1 3 5 7 FIND(5) Algorithms Design Techniques and Analysis