Added Kruskal’s Algorithm in Java (Java/graphs/KruskalAlgorithm.java)#206
Merged
admirerr merged 1 commit intoadmirerr:mainfrom Oct 30, 2025
Merged
Conversation
|
🎉 Welcome to Hacktoberfest 2025, @MJ-thunder! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎯 Great job! Your code compiled successfully. Maintainers @admirerr and @kartikey2991 will review your PR soon. 🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests✅ Passed - All code compiles successfully! 📋 Overall Status🎉 Ready for Review - Your PR has passed all automated checks! This comment was generated automatically. Checks will re-run when you push new commits. |
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
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 pull request adds an implementation of the Kruskal’s Algorithm in Java under the Java/graphs/ directory.
The file KruskalAlgorithm.java demonstrates how to find a Minimum Spanning Tree (MST) using the Disjoint Set (Union-Find) approach.
🧠 Details
Implemented Kruskal’s Algorithm with edge sorting and union–find cycle detection.
Added a main() method with sample input for quick testing.
Followed consistent structure and formatting used across existing graph algorithms (e.g., DijkstraAlgorithm.java, BellmanFord.java, etc.).
🏷️ Tags
hacktoberfest2025 java graphs minimum-spanning-tree beginner-friendly
✅ Checklist
Added KruskalAlgorithm.java under Java/graphs/
Code compiles and runs successfully
Included sample test case in main()
Follows existing naming and formatting conventions
💬 Notes
This addition enriches the graph algorithms collection by introducing a classic greedy MST algorithm, complementing other graph traversal and shortest-path implementations in the repository.