Add 'shortest_path' method#61
Merged
Merged
Conversation
itziakos
approved these changes
Jan 31, 2017
This was referenced Jul 25, 2017
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.
When asking "what's keeping object X alive", it's very useful to be able to look for a short path between a known (expected) live object and the target object X. Useful source objects are things like (a)
sys.modules, (b) the currentTestCaseobject.This PR adds a simple
shortest_pathmethod to all directed graphs that does a breadth-first search to find and return one of the shortest paths.