Use simpler graph for prioritization of mappings#80
Open
bgyori wants to merge 7 commits into
Open
Conversation
1 task
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Workflows for mapping prioritization have a large memory footprint which is traceable to the construction of a temporary networkx DiGraph used in prioritization. This PR implements a simplified approach to graph construction which uses a minimal undirected graph containing only the necessary structural information for connected component finding, without propagating additional data into the graph. This appears to significantly decrease memory usage, though more detailed unit testing would be useful to make sure there aren't any assumptions changing with this implementation.