Depth-first search finishes a vertex only after everything reachable from it is finished. So the finish order lists descendants before ancestors, and reversing it is a topological order. The path shows the vertices currently being explored. An edge back into that path is a cycle.
Topological sort by depth-first search finish order.
Enter 0. Its edges go to 1, 2. Unvisited: 1, 2. Go into 1 first.
Enter vertex 0. Next is 1.
Enter 1. Its edges go to 3. Unvisited: 3. Go into 3 first.
Enter vertex 1. Next is 3.
Enter 3. Its edges go to 4. Unvisited: 4. Go into 4 first.
Enter vertex 3. Next is 4.
Enter 4. Its edges go to nothing. Nothing new to explore below it, so 4 will finish.
Enter vertex 4. It has nothing new below it.
Finish 4 as number 1: everything reachable from it is already finished, so in the final order 4 must come before all of them.
Vertex 4 finishes as number 1.
Finish 3 as number 2: everything reachable from it is already finished, so in the final order 3 must come before all of them.
Vertex 3 finishes as number 2.
Finish 1 as number 3: everything reachable from it is already finished, so in the final order 1 must come before all of them.
Vertex 1 finishes as number 3.
Enter 2. Its edges go to 3, 5. Unvisited: 5. Go into 5 first.
Enter vertex 2. Next is 5.
Enter 5. Its edges go to nothing. Nothing new to explore below it, so 5 will finish.
Enter vertex 5. It has nothing new below it.
Finish 5 as number 4: everything reachable from it is already finished, so in the final order 5 must come before all of them.
Vertex 5 finishes as number 4.
Finish 2 as number 5: everything reachable from it is already finished, so in the final order 2 must come before all of them.
Vertex 2 finishes as number 5.
Finish 0 as number 6: everything reachable from it is already finished, so in the final order 0 must come before all of them.
Vertex 0 finishes as number 6.
Finish order 4, 3, 1, 5, 2, 0, reversed: 0, 2, 5, 1, 3, 4. Every edge points from a later finisher to an earlier one, so reversing the finish order sends all edges forward. O(V + E), one DFS.
The topological order is 0, 2, 5, 1, 3, 4.