Topological Sort — DFS

Run depth-first search on a DAG, push each node onto a stack the moment it finishes, then reverse the stack — that's your topological order.

Time: O(V + E)

Space: O(V)

Uses: DFS + Stack

Order: Reverse post-order

Speed: 1000ms

Step 1 of 0100%

Unvisited

On DFS stack

Finished (#=finish order)

DFS call stack (bottom → top):

Empty

Finish stack (push on completion):

—

Time:O(V + E)

Space:O(V)

Data Structure:Stack / recursion

Order:Reverse post-order

Question 1 of 3

In DFS-based topological sort, when is a node recorded?

DSAverse

Graph Algorithms

Loading Graph Algorithms...

BFS Traversal

visited: 0 / 7