Disjoint Union / Find Notes
Weighted union and path compression analyzed by Tarjan in 1975
- Worst case time complexity for a W-Union is O(1) and for a PC-Find is O(log n).
- Time complexity for m operations on n elements is O(m a(m,n)) where a is a very slow growing function a(m,n) < 4 for all practical m and n. a is called inverse Ackermann’s function. Essentially constant time per operation!