Problem Statement: We have a n*m maze with given source and destination cells. The maze can have multiple paths to reach its destination cell. Now, we need to find all possible paths to reach the destination cell from its starting cell. Finally after finding all the possible paths we need to display each solutions in the graphics window.

To run the code first graphics.h must be installed in computer.