Closed
Conversation
### 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
![algorithms-keeper[bot]](https://avatars.githubusercontent.com/in/235834?s=60&v=4){kind=small}
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
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 reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto 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.
Author
|
@darkstar @spazm @horstjens can you please review and accept my pull request |
Contributor
@ShristiC7 don't have any business on approving or reviewing PRs. Please stop naming me |
Author
|
@cclauss Added Prim's Algorithm. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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).