must then visit <strong>B</strong>'s neighbors before <strong>D</strong>'s neighbors. If, on the other hand, we visit <strong>D</strong> before <strong>B</strong> in our BFS, we would subsequently visit <strong>D</strong>'s neighbors before <strong>B</strong>'s neighbors.</p>
<p>Here again is the graph <strong>G<sub>1</sub></strong> for ease of reference:</p>
<p style="padding-left: 40px; width: 250px; text-align:center;"><span style="font-size: 10pt;"><strong><u>Graph G<sub>1</sub></u></strong></span></p>
