fff99; font-size: 10pt;"><em>Important terminological note!</em></span>) When we use this algorithm to explore an entire graph (rather than stopping at some particular node we're searching for), we can call it a depth-first traversal, although it's also common to just call it DFS even when we're not technically searching for a particular target node.</p>
<p>A DFS can start at any node in a graph. Consider, for example, the following graph, <strong>G<sub>1</sub></strong>:</p>
<p style="padding-left: 40px; wi