Added Prim's Algorithm for Minimum Spanning Tree in C++ in CPP/graph#10
Conversation
|
🎉 Welcome to Hacktoberfest 2025, @ramanuj-droid! 🎃 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. |
|
🎉 Welcome to Hacktoberfest 2025, @ramanuj-droid! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 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
This comment was generated automatically. Checks will re-run when you push new commits. |
Description
This PR adds an implementation of Prim's Algorithm for finding the Minimum Spanning Tree (MST) in a connected, undirected, and weighted graph using C++.
Features
Folder structure
The file is added under: