[FEATURE]: Data structure, Disjoint Set
its-kunal opened this issue · comments
Motivation
There is also a data structure to solve specific problems related to graphs—overlapping graphs and also used in algorithms like the Kruskal algorithm.
Examples
No response
Possible workarounds
No response
Additional information
No response
We already have such a "union find" data structure (placed in the "search" folder), and our implementation of Kruskal's algorithm brings its own. How to refactor these may be discussed, but the feature is already there.