Serialized instead of parallel path finding #348
Closed
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 PR implements an idea I raised in #346: instead of processing all initial paths in parallel, process them in serial.
Note that I've made that change for
find_minimal_partial_path_set_in_file
andfind_all_complete_partial_paths
, not the stitcher itself. Especialyl the former is often called with initial paths for all clickable nodes in the graph, and the effect on max memory usage should be noticable, I hope.