OurBigBook About$ Donate
 Sign in Sign up

Disjoint-set find operation (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
The disjoint-set find operation returns the disjoint-set representative of a stored set element x. It preserves the partition of a set. With path compression, it can change internal pointers while answering the same membership question. Inputs outside the stored set require a specified error policy; they are not silently inserted here.

 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 union operation
  • Path compression
  • Union by rank
  • Union-find operation bounds

 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