Repository navigation
Add infinite traversal methods - #58
Merged
davecom merged 3 commits intoNov 23, 2018
Merged
Conversation
This versions of Dfs and Bfs do not care if vertices have been already visited. This allows for example to model a for loop as a graph of statements and use on of this methods to simulate the execution of it.
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.
This versions of Dfs and Bfs do not care if vertices have been already visited. This allows for example to model a for loop as a graph of statements and use on of this methods to simulate the execution of it.