Implemented Depth First Search in a similar fashion as the Breadth First Search. Since there is no pseudocode available for it, I am guessing the only difference between BFS and DFS should be use of a stack instead of a queue and providing a different maze where the working of the algorithm can be visualized clearly.
Implemented Depth First Search in a similar fashion as the Breadth First Search. Since there is no pseudocode available for it, I am guessing the only difference between BFS and DFS should be use of a stack instead of a queue and providing a different maze where the working of the algorithm can be visualized clearly.