Kruskal's Minimum Spanning Tree algorithm using Union-Find

[anandraj095]

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 78.94%. Comparing base (b76962d) to head (54b8922).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #7171      +/-   ##
============================================
+ Coverage     78.91%   78.94%   +0.03%     
- Complexity     6853     6860       +7     
============================================
  Files           769      771       +2     
  Lines         22668    22708      +40     
  Branches       4456     4463       +7     
============================================
+ Hits          17888    17927      +39     
  Misses         4067     4067              
- Partials        713      714       +1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.