This is where you're given a graph G; in this case we're assuming a directed acyclic graph and you're given a start vertex S. And what you do is you, as soon as you get to S, you very aggressively start trying to explore its neighbors. 