Added Prim's Algorithm

[ShristiC7]

Prim’s Algorithm

• Language: C++
• Description: Constructs a Minimum Spanning Tree (MST) by starting with one vertex and repeatedly adding the smallest possible edge connecting a vertex inside the MST to one outside it.
• Complexity: O(E log V)
• Use Case: Network design, cost minimization

---

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.

---

• Add an algorithm
• Fix a bug or typo in an existing algorithm
• Add or change doctests
• Documentation change

---

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, I am opening separate PRs for separate algorithms.
• All new files are placed inside the appropriate existing directory (greedy_algorithms/).
• All filenames are in lowercase characters with no spaces or dashes (prims_algorithm.cpp).
• Code follows C++ naming and indentation conventions.
• Added inline comments for clarity and learning value.
• Included a reference to Wikipedia – Prim’s Algorithm.
• This pull request closes the related issue using the keyword: **Fixes [REQUEST] Add [Prim's Algorithm] in python #13400 **

[algorithms-keeper]

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

• Contributing guidelines
• Project Euler solution guidelines

Python:

• Formatted string literals (f-strings)
• Type hints
• doctest
• unittest
• pytest

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

---

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

• @algorithms-keeper review to trigger the checks for only added pull request files
• @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

[ShristiC7]

@darkstar @spazm @horstjens can you please review and accept my pull request

[bit-man]

@darkstar @bit-man @spazm @horstjens can you please review and accept my pull request

@ShristiC7 don't have any business on approving or reviewing PRs. Please stop naming me

[ShristiC7]

@cclauss Added Prim's Algorithm.

[cclauss]

Wrong repo: https://github.com/TheAlgorithms/C-Plus-Plus

• https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/prim.cpp
• https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/prims_minimum_spanning_tree.cpp