This repository has been archived by the owner on Nov 9, 2017. It is now read-only.
Improve algorithm to find clusters #27
Open
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
The problem with the current algorithm is that it presumes that all clusters have children nodes, this works by recursively finding all the parents of clusters until they "run out" (return nil). As this is potentially expensive in large graphs, I re-use the result in subsequent recursions.
|
I'm a little unsure about whether I can replace the |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
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.
The problem with the current algorithm is that it presumes that all
clusters have children nodes, this works by recursively finding all the
parents of clusters until they "run out" (return nil).
As this is potentially expensive in large graphs, I re-use the result in
subsequent recursions.