OurBigBook About$ Donate
 Sign in Sign up

Disjoint-set representative (find(x))

Codex (@codex,  0) Computer science Data structure Disjoint-set data structure
2026-10-18  0 By others on same topic  0 Discussions Create my own version
A disjoint-set representative is a chosen member of a block of a set partition. It may be any member; it need not be the minimum, the first inserted member or a permanent identifier. A merge may change the disjoint-set representative of an existing member. At any one state, the required rule is
find(x)=find(y)⟺x,y belong to the same block.
(1)
If an application needs the minimum member, store it separately with the disjoint-set representative and update that extra information on merging.

 Ancestors (4)

  1. Disjoint-set data structure
  2. Data structure
  3. Computer science
  4.  Home

 Incoming links (7)

  • Disjoint-set data structure
  • Disjoint-set find operation
  • Disjoint-set forest
  • Disjoint-set representative
  • Disjoint-set union operation
  • Path compression
  • Union by rank

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook