This program uses A* algorithm to find shortest path from source to destination and prints the maze and the path with the following heuristics - Eucledian , Manhattan , Random and Zero
You can upload your own maze as an encoding of 1s and 0s , 0 is considered an empty cell while 1 is conisdered as a wall.