 <strong>E</strong>? no (0)</li>
<li>edge from <strong>A</strong> to <strong>F</strong>? no (0)</li>
<li>edge from <strong>A</strong> to <strong>G</strong>? yes (1)</li>
</ul>
<p>The line after that tells us which nodes have an edge from vertex <strong>B</strong>, and so on.</p>
<p>5. Challenge yourself to code up BFS and DFS from scratch, on your own, without peeking back at your code for A2 or implementations posted online. (You should be doing this with most algorithms we cover in lecture. Regularly work