Q: Given a simple graph, print all the paths from source node to destination node.

A: We're going to traverse the graph and try all the possible paths we could get. We'll start DFS(Depth First Search) from the source node and will keep looking the different paths to destination during the course of complete dfs() procedure.
Input is given as 2-D matrix where 1 represents an edge and 0 represents no edge. In output there will be a path printed per line.