Skip to content
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

Implement Kruskal and Prims algorithm to find minimum spanning tree in C++ #90

Closed
rafu01 opened this issue Sep 30, 2020 · 5 comments
Closed

Comments

@rafu01
Copy link
Contributor

rafu01 commented Sep 30, 2020

I did not find any MST algorithm implemented in c++.

@rafu01
Copy link
Contributor Author

rafu01 commented Sep 30, 2020

I would like to work on this as hacktober fest

@amanmehara
Copy link
Owner

Hi @rafu01

Definitely, contribute the minimum spanning tree algorithms.
Create the PR for the same, I'll review and merge it.

Also have a look at https://github.com/amanmehara/programming/blob/master/CONTRIBUTING.md and make changes accordingly.
I'll approve and merge afterwards! 😃

@rafu01
Copy link
Contributor Author

rafu01 commented Oct 1, 2020

thanks, I'm working on it

@rafu01
Copy link
Contributor Author

rafu01 commented Oct 2, 2020

done, check #128

@amanmehara
Copy link
Owner

Closing in favor of #78.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants