Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Enhancement Idea: Adding new BFS algorithm (forward and reverse) for finding full paths flow #104

Open
assafsun opened this issue Jun 8, 2019 · 0 comments
Open

Enhancement Idea: Adding new BFS algorithm (forward and reverse) for finding full paths flow #104

assafsun opened this issue Jun 8, 2019 · 0 comments

Comments

@assafsun
Copy link

assafsun commented Jun 8, 2019

Adding new BFS algorithm (forward and reverse) for finding full paths in order to find for a certain node, all the nodes that affect him or he affect on.

This algorithm can be used in order to understand in graphs which represent data flows which sources affect on a certain data.

What do you think?
I didn't found a straight algorithm that can give entire flow (forward or reverse), please let me know if I missed something.
@assafsun assafsun changed the title Enhancement Idea: Adding new BFS algorithm (forward and reverse) for finding full paths Enhancement Idea: Adding new BFS algorithm (forward and reverse) for finding full paths flow Jun 8, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@assafsun