Union-find is a data structure that maintains disjoint set (called connected components or components in short) membership, and makes it easier to merge (union) two components, and to find if two elements are connected (i.e., belong to the same component).
This implements the "weighted-quick-union-with-path-compression" union-find algorithm. Only works if elements are immutable objects.
Worst case for union and find (N + M \log^* N), with N elements and M union/find operations. The function \log^* is the number of times needed to take \log (base 2) of a number until reaching 1. In practice, the amortized cost of each operation is nearly linear [1].
Update: This has now been packaged into an instalable pip package by Hagai Helman Tov (@hagai-helman). See the fork at https://github.com/hagai-helman/unionfind).
- Module
unionfindwith the classUnionFind - An example notebook
UnionFindExamples.ipynb - License: MIT.
numpy
| [1] | http://algs4.cs.princeton.edu/lectures/ |