Topological sort showing both Kahn's (BFS) and DFS finish-time methods.
Queue of zero-indegree nodes
empty
Build order (output)
none
Step 0 / 0
Press Play. Both methods produce a valid topological order — they just compute it differently.
Speed
timeline0 / 0
←→space walk steps