-- Depth First Search / DFS --
1 ) Enter the size of a labyrinth as a number. The labyrinth will be n * 2 pixels wide.
2 ) The program will now create and solve the labyrinth.
3 ) Enter a filename with .txt entension to print it as a textfile.
4 ) Then the program will show in an image :
- the solution path in blue
- the path that DFS tried in purple.
5 ) It will save the image in the root folder. Here is an example of what it would look like :
