Maximal cliques and all-pairs shortest path algorithms #40
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
…nd associated tests.
… a Set in Bron-Kerbosch (maximal cliques).
|
Is this change OK? Happy to modify in order to for it to be accepted. |
|
Sorry for not getting back to you on this sooner -- something else has been occupying me in the past couple months. I'll get back to you on this by this weekend. Thanks! |
|
This looks great! Once the I agree with you that we should have the same format for paths and distance info (also, brought up in #10). |
aysylu
pushed a commit
that referenced
this pull request
Aug 27, 2014
Maximal cliques and all-pairs shortest path algorithms
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.
I added the Bron-Kerbosch algorithm for finding maximal cliques as well as Johnson's algorithm and breadth-first all-pairs shortest path for finding paths between all vertices.
I didn't make the change, but I propose the span functions for Bellman-Ford, Dijkstra's, and breadth-first should all return paths and distance information in the same format.