Following up on this, I might as well go ahead and make a visualization of Breadth-first search. Or even
better I could visualize DFS and BFS simultaneously.
So here it is (start and end points in black):
On DFS path   On BFS path   On both paths
Visited by DFS   Visited by BFS   Visited by both
Large mazes may kill your browser.