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