Skip to content

Conversation

@MJ-thunder
Copy link
Contributor

📘 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.

@github-actions
Copy link

🎉 Welcome to Hacktoberfest 2025, @MJ-thunder! 🎃

Thank you for your first contribution to our DSA repository! Here's what happens next:

🔍 Automatic Checks

  • Code Validation: Passed
  • 🧪 Compilation Tests: Passed

📋 Next Steps

🎯 Great job! Your code compiled successfully. Maintainers @admirerr and @kartikey2991 will review your PR soon.

🎁 What You Get

  • 🏆 Hacktoberfest Credit: This PR counts toward your 6 PR goal for exclusive T-shirt + Tree!
  • 🌟 Hall of Fame: You'll be featured in our contributors list
  • 📚 Learning: Code review feedback from experienced developers

💡 Tips for Success

  • Follow our Contributing Guidelines
  • Add comments explaining your algorithm
  • Include time/space complexity analysis
  • Test your code before submitting

Welcome to the community! 🚀

@github-actions
Copy link

🤖 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!
👥 Maintainers have been notified for review.


This comment was generated automatically. Checks will re-run when you push new commits.

@admirerr admirerr merged commit 98c8afa into admirerr:main Oct 30, 2025
16 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants