oring different branches through the graph. That is, it goes&nbsp;</span><em>deep</em><span>&nbsp;before&nbsp;</span><em>branching out</em><span>. We encountered DFS earlier this quarter in A2, when we explored mazes via the <span class="code-chonk">Grid</span> class. We observed that behavior again in the mazerunning I presented in class when we covered backtracking:</span></p>
<p style="padding-left: 40px;"><span><img src="resources/mazerunner-multi.gif" /></span></p>
<p>(<span style="background-color: #f