Rare card
Disjoint-set data structure
- Value
- 50 W
- Attack
- 247
- Defence
- 198
- Players
- 0
In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint (non-overlapping) sets. Equivalently, it stores a partition of a set into disjoint subsets.
Get Disjoint-set data structure in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack