Disjoint-set data structure

How it is used

Also called union-find. Used for connectivity and grouping algorithms; it is not a general collection of arbitrary overlapping sets.

Example sentences

1. The disjoint-set data structure tracks which network nodes are already connected.

   Nodes in the same group can be recognized without walking every connection again.

2. We used a disjoint-set data structure to join two account groups when a shared identifier linked their accounts.

   The structure maintains separate groups until a discovered link causes their union; it does not store overlapping group memberships.

Common collocations

• disjoint-set data structure operations
• implement a disjoint-set data structure

Related terms

• setA collection that stores distinct values and supports operations such as membership checks, union and intersection.
• algorithmA clear, step-by-step method for solving a problem or doing a task, such as sorting a list or finding the shortest route between two points.

More terms: Data Structures and Algorithms

• data structure
• array
• iterate
• hash map
• recursion
• Big O notation
• time complexity
• index
• sort
• stack
• queue
• linked list