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.