A disjoint-set data structure is a data structure that holds a set of data divided into element sets (sets that do not overlap with each other). disjoint sets. see UnionFind
This page is auto-translated from /nishio/素集合データ構造 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.