Feature/graph algorithms

[Abdullah-Shah-26]

Summary

Implemented Kruskal’s Algorithm to compute the Minimum Spanning Tree (MST)
of a weighted undirected graph.

Approach

• Sort edges by weight (greedy choice).
• Use Disjoint Set Union (Union-Find with path compression + union by size)
  to avoid forming cycles.
• Continue until MST contains V-1 edges.

Complexity

• Time: O(E log E) due to sorting
• Space: O(V + E) for DSU and edge storage

Verification

• Tested on sample graph (4 vertices, 5 edges).
• Produces correct MST weight = 19.

[github-actions]

🔍 Duplicate Detection Results

⚠️ Potential Duplicates Found

⚠️ Potential Duplicate: CPP/algorithms/graph_algorithms/kruskal_algorithm.cpp
Similar file(s) already exist:

• CPP/algorithms/greedy_algorithms/kruskal_algorithm.cpp

📝 What This Means

We found existing implementations that appear similar to your contribution. This doesn't necessarily mean your PR will be rejected, but please review:

1. Is this truly a duplicate? Check the existing files to see if they implement the same algorithm
2. Is your implementation different/better? If so, explain in your PR description:
   • What makes it different
   • Why it's an improvement
   • Any unique features or optimizations
3. Consider improving existing code instead of adding a duplicate

✅ What To Do Next

• If it's a duplicate: Consider withdrawing this PR and improving the existing implementation
• If it's different: Add a clear explanation in your PR description about how it differs
• If unsure: Ask the maintainers for guidance!

💡 Quality Over Quantity

Remember: One high-quality, unique contribution is worth more than multiple duplicates! 🌟

---

This is an automated check. Maintainers will make the final decision.

[github-actions]

🎉 Welcome to Hacktoberfest 2025, @Abdullah-Shah-26! 🎃

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

🔍 Automatic Checks

• ✅ Code Validation: Failed
• 🧪 Compilation Tests: Failed

📋 Next Steps

⚠️ Action needed: Please fix the compilation errors and push your changes.

🎁 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]

🤖 Automated PR Status

🔍 Code Validation

❌ Failed - Please check file naming conventions and directory structure.

🧪 Compilation Tests

❌ Failed - Please fix compilation errors and try again.

📋 Overall Status

⚠️ Needs Work - Please address the issues above.
💡 Push new commits to automatically re-run these checks.

---

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

[Karanjot786]

Hi @Abdullah-Shah-26, I think you deleted the file

[Abdullah-Shah-26]

Yeah Deleted by mistake 😅. Will rectify it