Add adaption of the C++ implementation [1] for the
"Wait-free Parallel Algorithms for the Union-Find Problem" [2]
with some input from an atomic DSS implementation in Rust [3].
A PriorityQueue specialized for ints that maintains a partial ordering of
its elements such that the smallest value can always be found in constant time.
iterates over a range of long values in random order
using a https://en.wikipedia.org/wiki/Linear_congruential_generator
without having to have all the numbers in memory.
TODO: Define interface contract, esp regarding source/target node ids returned and how that maps to relationship direction
consumer interface for relationships without property.