A Ruby implementation of the disjoint set forest, or union find, data structure. This implementation uses path compression and union by rank to ensure optimal complexity.
Required Ruby Version
>= 0
Authors
Lane Miles
A Ruby implementation of the disjoint set forest, or union find, data structure. This implementation uses path compression and union by rank to ensure optimal complexity.
>= 0
Lane Miles