This module implements the Disjoint Set Union (DSU), also known as Union-Find, which is an efficient data structure for keeping track of a set of elements partitioned into disjoint (non-overlapping) subsets. Represents a node in the Disjoint Set Union (DSU) structure which keep track of the parent-child relationships in the disjoint sets.
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected