1# Lock-free parallel disjoint set data structure 2 3This is a small self-contained C++11 implementation of the UNION-FIND data 4structure with path compression and union by rank and a few extras It supports 5concurrent `find()`, `same()` and `unite()` calls as described in the paper 6 7*Wait-free Parallel Algorithms for the Union-Find Problem* 8by Richard J. Anderson and Heather Woll 9 10In addition, this class supports optimistic locking (`try_lock()`/`unlock()`) 11of disjoint sets and a *combined* unite+unlock operation for pairs of sets. 12