fix: Add a new graph traversal that allows more than one edges out of a graph #250
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 current graph traversal is very sub-optimal and confusing. We were iterating throught all the nodes and then looking for the edges out of this. Also, it was constrained that one node could be connected to another node
For usecases such as n-level deep search, there would be a requirement to add more than child nodes out of the node. For example, pipeline for n-level deep search would look like:
