About this document
Disjoint Set Data Structure Overview by Swagata Rana is a document available to read on EtoBox.
The disjoint set data structure partitions a set of items into mutually exclusive sets, where each item belongs to exactly one set. It supports two main operations: Find, which determines which set an item belongs to; and Union, which combines two sets. The disjoint set can be represented using a parent pointer array, where each item points to its parent representative in the set. Improved algorithms like path compression and union by rank can perform Find and Union operations in nearly constant time on ave
- Author
- Swagata Rana
- Language
- EN