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.92%. Comparing base (48e02b3) to head (90cf74a).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #7171      +/-   ##
============================================
+ Coverage     78.90%   78.92%   +0.02%     
- Complexity     6858     6865       +7     
============================================
  Files           771      773       +2     
  Lines         22688    22728      +40     
  Branches       4457     4464       +7     
============================================
+ Hits          17901    17939      +38     
- Misses         4072     4073       +1     
- Partials        715      716       +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.

[github-actions]

This pull request has been automatically closed because its workflows or checks failed and it has been inactive for more than 14 days. Please fix the workflows and reopen if you'd like to continue. Merging from main/master alone does not count as activity.