Add distance matrix functions #166
Merged
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
This commit adds 2 new functions, graph_distance_matrix() and digraph_distance_matrix(), which will generate a distance matrix for a graph object. It is for use cases when all edges are unweighted or have the same weight and is significantly faster than other algorithms because of this assumption. It also operates in parallel if the size of the graph justifies it.
Pull Request Test Coverage Report for Build 350103578
💛 - Coveralls |
This was referenced Oct 6, 2020
This was referenced Oct 8, 2020
lcapelluto
approved these changes
Nov 6, 2020
Co-authored-by: Lauren Capelluto <laurencapelluto@gmail.com>
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 commit adds 2 new functions,
graph_distance_matrix()anddigraph_distance_matrix(), which will generate a distance matrix for agraph object. It is for use cases when all edges are unweighted or have
the same weight and is significantly faster than other algorithms
because of this assumption. It also operates in parallel if the size of
the graph justifies it.