The repository contains the topics learned while going through the course of Part 3 under the Algorithmic Specialisation - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming. I have implemented various fundamental algorithms under this course in this repo.
This is an empyrical analysis of the Union-Find data structure, together with many different heuristics for union and path compression.
Add a description, image, and links to the union-find-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the union-find-algorithm topic, visit your repo's landing page and select "manage topics."