Directed graph where DFS returns on a node before all its child nodes are visited?
Consider the following graph. If DFS will first go to the second node, it will back up even though the third node is reachable from the second.