Given a directed graph, a vertex โv1โ and a vertex โv2โ, print all paths from given โv1โ to โv2โ. The idea is to do Depth First Traversal of given directed graph. Start the traversal from v1. Keep storing the visited vertices in an array say path[]. If we reach the vertex v2, pathExist becomes true