Add Kruskal's Algorithm implementation #7121
Open
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