Disjoint Set | Union-Find Algorithm - Union by rank and path compression | Algorithms
Union-Find Algorithm. Disjoint Set is optimized by • Union by rank. • Path by compression. A disjoint-set data structure, also called a union–find data structure or merge–find set. A disjoint-set data structure that keeps track of a set of elements partitioned into a number of disjoint or non-overlapping subsets.
Post to Tumblr