A Go implementation of the Disjoint-Set (Union-Find) data structure for managing non-overlapping sets with efficient union and find operations.
Disjoint Set data structure implementation in Go
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.