✳flâneur — a map of the web's best reading

Disjoint Set Union - Algorithms for Competitive Programming

cp-algorithms.com · 5,337 words · saved by 1 readers

This article discusses the data structure Disjoint Set Union or DSU. Often it is also called Union Find because of its two main operations.

cp-algorithms is supported by Coddy - interactive coding practice Last update: March 29, 2026   Translated From: e-maxx.ru Disjoint Set Union ¶ This article discusses the data structure Disjoint Set Union or DSU . Often it is also called Union Find because of its two main operations. This data structure provides the following capabilities. We are given several elements, each of which is a separate set. A DSU will have an operation to combine any two sets, and it will be able to tell in which set a specific element is. The classical version also introduces a third operation, it can cr

Explore this link on the map →

related reading