Union Find is an algorithm that uses a disjoint-set data structure. It allows us to efficiently connect any items of a given list and to efficiently check whether two items of this list are connected (any degree of separation) or not.

Required Ruby Version

>= 0

Authors

Michael Imstepf

Versions

  1. 0.0.2

    1. source

      1. 0.0.2 source July 04, 2014 (9.5 KB)
  2. 0.0.1

    1. source

      1. 0.0.1 source June 29, 2014 (9 KB)

SHA 256 checksum

← Previous version