One can model a maze by having a vertex for a starting point, a finishing point, dead en...

One can model a maze by having a vertex for a starting point, a finishing point, dead ends, and all the points in the maze where more than one path can be taken, and then connecting the vertices according to the paths in the maze.

a. Construct such a graph for the following maze.

b. Which traversal—DFS or BFS—would you use if you found yourself in a maze and why?