-
-
Notifications
You must be signed in to change notification settings - Fork 4.5k
feat: Prims algorithm #815
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Who needs to review the code I've added? What exactly are they reviewing for? My code has passed the automated tests. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Hey @Sl1mb0, Thanks for your contribution.
Please follow the Repository Standard Guidelies strictly.
Did I not follow the guidelines? I can't find an issue. |
@Sl1mb0 great input. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There is no proper documentation, and the code is not up to the repository standards. Please follow the steps documented. You can see #797 as a reference. Thanks. 🙂
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Good work!
04ae689
to
87da82e
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please address all the unresolved conversations above. 🙂
257e258
to
8eae8dd
Compare
Amazing work. The results are game changing |
Does anything else need to be done? |
Okay I went through and made all the requested changes. Thanks for your help @Panquesito7! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Very nice and amazing work, @Sl1mb0! Thank you for your contribution! 👍 🎉
feat: Prims algorithm (TheAlgorithms#815)
Description of Change
I implemented prim's algorithm and added
prim.c
toTheAlgorithms/C/greedy_approach
.Prim's algorithm finds a minimum spanning tree of a weighted, connected graph.
Using a 'greedy' approach to generate the MST, the algorithm searches for a minimally weighted, non-visited edge, and adds the vertex connected by that edge to the MST.
To test, compile and run.
Enter in adjacency matrix of a weighted, connected graph.
References
pg. 319 "Introduction to the Design and Analysis of Algorithms" - Anany Levitin
Checklist
Notes: