nbsp;F</span></li>
<li><span>C&nbsp;&nbsp;&nbsp;&nbsp;B&nbsp;&nbsp;&nbsp;&nbsp;A&nbsp;&nbsp;&nbsp;&nbsp;G&nbsp;&nbsp;&nbsp;&nbsp;E&nbsp;&nbsp;&nbsp;&nbsp;F&nbsp;&nbsp;&nbsp;&nbsp;D</span></li>
</ul>
<p>DFS can be implemented using a stack, <a class="inline_disabled" href="../../assignments/2-adt/maze.html#4-write-solvemazedfs" target="_blank" rel="noopener">as described in A2</a>.</p>
<p><strong><br />Breadth-First Search (BFS)</strong></p>
<p>BFS takes the complementary tack to DFS. It explores all the nei