Basic union/find: Verifies correct parent and rank after multiple unions.
Single node: Confirms findSet() returns the node itself for isolated nodes.
Union of connected nodes: Ensures repeated unions maintain correct root.
Rank increase: Validates rank updates correctly when merging equal-rank trees.
Multiple makeSets: Confirms unique sets are created with correct initial parents.
Path compression: Checks that findSet() flattens tree by updating parent pointers.

I have readCONTRIBUTING.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 withclang-format -i --style=file path/to/your/file.java

testing: improving test coverage DisjointSetUnionTest

2e83877

alxkm requested review fromDenizAltunkapan,yanglbme andvil02 ascode owners

July 16, 2025 19:41

Copy link

codecov-commenter commentedJul 16, 2025•
edited
Loading

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 74.65%. Comparing base(5c6d3c3) to head(b96d036).

Additional details and impacted files

@@             Coverage Diff              @@##             master    #6394      +/-   ##============================================- Coverage     74.66%   74.65%   -0.01%+ Complexity     5459     5458       -1============================================  Files           682      682                Lines         19010    19010                Branches       3670     3670              ============================================- Hits          14193    14192       -1  Misses         4258     4258- Partials        559      560       +1

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

🚀 New features to boost your workflow: