Kahn's topological sort animated on a task DAG: in-degrees tick down, zero-degree tasks emit in order, and leftover nodes reveal a cycle.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Topological Sort Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Kahn's topological sort animated on a task DAG: in-degrees tick down, zero-degree tasks emit in order, and leftover nodes reveal a cycle. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
DFS Visualizer: Depth-first search on a graph: the stack dives deep and backtracks, building a DFS tree — every push, pop, and visit narrated step by step.
Open toolBFS Visualizer: Breadth-first search on a graph: the queue-driven frontier expands ring by ring with every discovery narrated — plus a grid version with walls.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open toolin-degree: wake:0 brew:0 code:1 test:1 commit:1 push:4 deploy:3
1Topological sort (Kahn's algorithm) of a task DAG (edges point prerequisite → dependent): repeatedly emit a node with in-degree 0.
compute in-degreesqueue nodes with in-degree 0emit u; decrement its dependentsnewly-zero nodes join the queueemitted < V ⇒ cycle detected
Order a DAG so every edge points forward: repeatedly emit an in-degree-0 node. Leftover nodes ⇒ a cycle exists.
