Enumerating all paths in a directed acyclic graph

by

Finding all the possible paths in any graph in Exponential. It can be solved by using Backtracking.
For DAG’s we can do it using Depth first search(DFS).
In DFS code, Start at any node, Go to the extreme dead end path and note down all the nodes visited in that path using some array or list. As soon as you find a dead end print the array containing the visited nodes and pop the last stored node and start in the other path of the (n-1)th node. If all the paths of the (n-1)th node are exhausted pop that node from list and start at (n-2)node. Do this untill you reach all the dead ends and reach the first node.
All the Printed paths are the Paths in the given DAG.

You can check the code http://pastebin.com/p6ciRJCU

More Related Contents:

  1. Cycles in an Undirected Graph
  2. Millions of 3D points: How to find the 10 of them closest to a given point?
  3. Graph auto-layout algorithm
  4. Find connected components in a graph [closed]
  5. Finding all the shortest paths between two nodes in unweighted undirected graph
  6. Algorithm for “nice” grid line intervals on a graph
  7. How to implement depth first search for graph with a non-recursive approach
  8. Longest acyclic path in a directed unweighted graph
  9. help in the Donalds B. Johnson’s algorithm, i cannot understand the pseudo code (PART II)
  10. Why use Dijkstra’s Algorithm if Breadth First Search (BFS) can do the same thing faster?
  11. What algorithm to use to determine minimum number of actions required to get the system to “Zero” state?
  12. How does Dijkstra’s Algorithm and A-Star compare?
  13. Find cycle of shortest length in a directed graph with positive weights
  14. graph – Dijkstra for The Single-Source Longest Path
  15. Planar Graph Layouts
  16. Explanation of Algorithm for finding articulation points or cut vertices of a graph
  17. Bridges in a connected graph
  18. How to find the number of different shortest paths between two vertices, in directed graph and with linear-time?
  19. Finding connected components of adjacency matrix graph
  20. Complete graph with only two possible costs. What’s the shortest path’s cost from 0 to N – 1
  21. Appointment scheduling algorithm (N people with N free-busy slots, constraint-satisfaction)
  22. Sum a number with divisors to get another number
  23. Reverse the ordering of words in a string
  24. Converting a Uniform Distribution to a Normal Distribution
  25. Can hash tables really be O(1)?
  26. Fast way to calculate n! mod m where m is prime?
  27. Sum-subset with a fixed subset size
  28. Travelling Salesman with multiple salesmen?
  29. How modern X86 processors actually compute multiplications?
  30. how do I create a line of arbitrary thickness using Bresenham?

Leave a Comment