title: Enumerating all paths in a directed acyclic graph
body: <p>Is there any standard algorithm that finds all possible paths in a directed a-cyclic graph.
  If not, how can i make changes in BFS/Dijkstra/any other algorithm  to enumerate all paths in a DAG</p>