bsp;&nbsp;&nbsp;&nbsp;A&nbsp;&nbsp;&nbsp;&nbsp;G&nbsp;&nbsp;&nbsp;&nbsp;F</span></li>
<li><span>C&nbsp;&nbsp;&nbsp;&nbsp;D&nbsp;&nbsp;&nbsp;&nbsp;B&nbsp;&nbsp;&nbsp;&nbsp;E&nbsp;&nbsp;&nbsp;&nbsp;A&nbsp;&nbsp;&nbsp;&nbsp;F&nbsp;&nbsp;&nbsp;&nbsp;G</span></li>
</ul>
<p><span>BFS can be implemented using a queue, <a class="inline_disabled" href="../../assignments/2-adt/maze.html#3-write-solvemazebfs" target="_blank" rel="noopener">as described in A2</a> (as well as in class today).</span></p>
<p><br /><strong