gatb.core-API-0.0.0
|
#include <unionFind.hpp>
Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
Supports concurrent find(), same() and unite() calls as described in the paper
"Wait-free Parallel Algorithms for the Union-Find Problem" by Richard J. Anderson and Heather Woll
In addition, this class supports optimistic locking (try_lock/unlock) of disjoint sets and a combined unite+unlock operation.