This document provides an overview of union-find algorithms on disjoint-set data structures. It introduces the connectivity problem and describes 5 different implementations of union-find algorithms - quick find, quick union, weighted quick union, quick union path compression, and weighted quick union path compression. It includes code examples and analyzes the time complexity of each algorithm. The document also applies these algorithms to solve the problem of image coloring and provides information on future webcasts covering additional algorithms.