Class DisjointSet

Disjoint Set (Union-Find) data structure A disjoint-set data structure (also called union-find) keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It supports two operations: union (join two subsets) and find (determine which subset an element is in).

Example

const ds = new DisjointSet(5);
ds.union(0, 1);
ds.union(2, 3);
ds.isConnected(0, 1); // true
ds.isConnected(0, 2); // false
ds.union(1, 2);
ds.isConnected(0, 3); // true
Copy