Which data structure is used in disjoint set?
Which data structure is used in disjoint set? In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint (non-overlapping) sets. Equivalently, it stores a partition of a set into disjoint subsets. Is disjoint set a data structure? The disjoint […]