ghbors of a vertex before moving on to the neighbors' neighbors. It goes as <em>broad</em> as possible before going <em>deeper</em> into the graph.</p>
<p>(<span style="background-color: #ffff99; font-size: 10pt;"><em>Important terminological note!</em></span>) As with DFS, when we use BFS to explore an entire graph (rather than stopping at some particular node we're searching for), we can call it a breadth-first traversal, although it's also common to just call it BFS even when we're not technically search