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.
Prim’s Algorithm
Describe your change:
Added a complete implementation of Prim’s Algorithm in C++ under the Greedy Algorithms category.
The program uses an adjacency list representation and a priority queue (min-heap) to select edges efficiently.
It prints the edges included in the MST along with the total weight.
The code is beginner-friendly, well-commented, and formatted for readability.
Checklist:
greedy_algorithms/
).prims_algorithm.cpp
).