I am trying to find all the paths between two nodes in a directed graph with no cycles. Number of nodes may be in hundreds, what is the best iterative implementation of DFS in python to get the solution. Also, I tried recursive method, but it doesn't help as it gives error of max recursive depth. Increasing recursive depth is not possbile.
Thank you!