Kosaraju's two DFS passes animated on a directed graph — finish order, reversed edges, and each component painted its own color.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Strongly Connected Components Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Kosaraju's two DFS passes animated on a directed graph — finish order, reversed edges, and each component painted its own color. 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 toolArticulation Points & Bridges Visualizer: Tarjan's low-link DFS animated: discovery times, low values, and every cut vertex and bridge — your graph's single points of failure — highlighted.
Open toolTopological Sort Visualizer: 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.
Open tool1Strongly Connected Components (Kosaraju): pass 1 — DFS the graph recording FINISH order; pass 2 — DFS the REVERSED graph in reverse finish order; each pass-2 tree is one SCC.
DFS pass 1: record finish order(last finished = start of pass 2)reverse every edgeDFS pass 2 in reverse finish order:each tree found = one SCCcondensation of SCCs is a DAG
Two DFS passes — one for finish order, one on the reversed graph — paint each strongly connected component a color. Condensing them leaves a DAG.
