-
Notifications
You must be signed in to change notification settings - Fork 20.9k
Add Kruskal's Algorithm implementation #7121
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
RamsaiPolisetti
wants to merge
1
commit into
TheAlgorithms:master
from
RamsaiPolisetti:add-kruskals-algorithm
Open
Add Kruskal's Algorithm implementation #7121
RamsaiPolisetti
wants to merge
1
commit into
TheAlgorithms:master
from
RamsaiPolisetti:add-kruskals-algorithm
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@RamsaiPolisetti
RamsaiPolisetti
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
November 25, 2025 17:05
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@ ## master #7121 +/- ## ============================================ - Coverage 78.51% 78.29% -0.23% + Complexity 6752 6751 -1 ============================================ Files 759 760 +1 Lines 22402 22461 +59 Branches 4400 4410 +10 ============================================ - Hits 17589 17585 -4 - Misses 4108 4169 +61 - Partials 705 707 +2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary
This PR adds an implementation of Kruskal's Minimum Spanning Tree (MST) algorithm to the
graphpackage.Kruskal’s algorithm is a classic greedy algorithm that finds the MST of a connected, undirected, weighted graph by selecting edges in increasing order of weight while avoiding cycles.
Implementation Details
KruskalsAlgorithm.javaundersrc/main/java/com/thealgorithms/graph/Edgeclass for representing edgesDSU(Disjoint Set Union / Union–Find) for cycle detectionkruskalMST()method implementing the core algorithmTests
src/test/java/com/thealgorithms/graph/V - 1edges.All tests pass using
./gradlew test.Checklist