'Why is there no Disjoint Set (Union Find Algorithm) implemented in most mainstream programming languages' standard library?
I have found articles on how to implement a Disjoint Set (Union Find Algorithm implementation) for C++, Java, Kotlin, Python, etc.. The implementation of it is not especially difficult, although there is some room for error. It surprised me that no languages include a form of this in their standard library.
Is there a reason for this? Given how many various data structures exist in most standard libraries already, I am surprised that not one (that I have found) includes this. Is it just too obscure to include?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|