disjoint_set_forest

https://github.com/lanemiles/disjoint_set_forest

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.