Add Kruskal's algorithm for minimal spanning tree #128
Conversation
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
mgechev
approved these changes
Nov 29, 2017
|
@maurobringolf will add a reminder to update the list of contributors soon. |
|
@mgechev So cool, thank you! I will look into more algorithms to add/improve. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This repo is really cool and I would like to contribute 🎉 . I added an implementation of Kruskal's MST algorithm and one of the examples from Wikipedia as test case. I tried to mimic the module style of existing algorithms, let me know if I should change the structure or if anything else is missing.
I am not sure how to add documentation for the website, but am willing to help with it if you tell me what to do.