Topological Sort Visualizer
Define Graph
Number of Nodes:
Edges (e.g., 0-1,0-2,1-3):
Create/Update Graph
DFS
BFS (Kahn's)
DFS Based Topological Sort
Start DFS
Next Step
Reset
Recursion Stack:
Visited:
Path Visited:
Sorted List:
Code Snippet (DFS)
BFS (Kahn's Algorithm) Based Topological Sort
Start BFS
Next Step
Reset
Queue:
In-degrees:
Sorted List:
Code Snippet (BFS)