Count all possible paths between two vertices
Problem Statement Given the directed, connected and unweighted graph G, and the task to find the number of all paths possible between two given vertices. Note: The path does not contain any cycle which means path have finite number of vertices. Example Input Expected Output 4 Approach The idea is to use backtracking. Traverse the path …
