Enhancement Idea: Adding new BFS algorithm (forward and reverse) for finding full paths flow
assafsun opened this issue · comments
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.