Disjoint Set
Disjoint Set / Union-Find tracks a collection of non-overlapping groups and supports two key operations: find which group an item belongs to, and union two groups.
이 멘탈 모델부터 시작하세요
Disjoint Set / Union-Find tracks a collection of non-overlapping groups and supports two key operations: find which group an item belongs to, and union two groups.
불필요한 전문용어 없이 동작 방식 이해하기
Each set has a representative root.
Path compression and union by rank/size make repeated operations almost constant amortized time.
알고리즘을 연속된 의사결정으로 읽기
Identify the invariant that must always remain true.
Follow the read/update path through the structure.
After a mutation, restore the invariant before returning.
Read a tiny input by hand and write down the state after every important operation. For Disjoint Set, the goal is to make the invariant visible rather than to memorize code.
amortized near O(1)
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
적합한 경우
- Kruskal MST
- Connectivity queries
- Cycle detection in undirected graphs
보통 어디에서 문제가 생기는가
- Memorizing complexity without understanding representation.
- Ignoring worst-case shape or resizing/rebalancing costs.
전문적인 답변 구조
Name both optimizations—path compression and union by rank/size—and explain that the amortized complexity is inverse-Ackermann, effectively constant for practical sizes.
What problem does Disjoint Set solve?
Disjoint Set / Union-Find tracks a collection of non-overlapping groups and supports two key operations: find which group an item belongs to, and union two groups.
복잡도에 대해 무엇을 언급해야 하나요?
Its typical cost here is amortized near O(1), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
가장 흔한 실수는 무엇인가요?
Memorizing complexity without understanding representation.