Add Kruskal's minimum spanning tree algorithm #71
Conversation
This file contains 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
|
Mind including it in main.js? Thanks! |
felipernb
added a commit
that referenced
this pull request
Jul 22, 2014
Add Kruskal's minimum spanning tree algorithm
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.
Tests are put into minimum_spanning_tree.js, though algorithm itself lives in kruskal.js. The reason for this is that tests for any of MST algorithms (another one is Prim's) should probably be the same.
Another option is to extract some code from minimum_spanning_tree.js to test/algorithms/graph/kruskal.js and require that file from there. In this case there would be two test suites instead of a single one, but it would preserve clear one-to-one correspondence between algorithms and test files. I am not sure if this option is better.