Union-Find (Disjoint Set Union)
RU: Union-Find (система непересекающихся множеств)
A data structure that maintains a partition of elements into disjoint sets as a parent[] forest, where each set is a tree whose root is its representative. It answers 'are these two in the same set?' and merges sets, which makes counting connected components incremental as edges arrive.