How can you get a topological sort with DFS? — Do a DFS, and when each node is being marked as complete, add node to a list. Reverse the list.

This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university