The program to trace all the paths of a directed graph from the given source node to the destination node is discussed here.

Given the adjacency representation of a directed graph, find all the paths of the graph from source to destination.

Algorithm to trace all the paths of a directed graph from source to destination

• Input the adjacency list representation of the directed graph.
• Start the traversal from the given source node.
• Store the visited vertices in a temporary array and mark the vertices ‘visited
• On reaching the destination vertex, print the temporary array.

Click here to learn more about FACE Prep PRO

Program to trace all the paths of a directed graph from source to destination

@@coding::1@@

Recommended Programs

• Open and closed gates problem
• Number of Islands
• N digit numbers with digits in non-decreasing order
• Maximum number of As using four keys