Tarjan's low-link DFS animated: discovery times, low values, and every cut vertex and bridge — your graph's single points of failure — highlighted.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Articulation Points & Bridges Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Tarjan's low-link DFS animated: discovery times, low values, and every cut vertex and bridge — your graph's single points of failure — highlighted. 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.
Strongly Connected Components Visualizer: Kosaraju's two DFS passes animated on a directed graph — finish order, reversed edges, and each component painted its own color.
Open toolDFS 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 toolUnion-Find (DSU) Visualizer: Disjoint Set Union animated: union by rank merges trees, find compresses paths — parent and rank arrays shown live with every operation narrated.
Open tool1Articulation points & bridges (Tarjan low-link): DFS stamps each node's discovery time; low[u] = earliest discovery reachable from u's subtree. A child that can't reach above its parent marks a cut.
DFS stamping disc[] timeslow[u] = min reachable disc via subtreechild low > parent disc → BRIDGEchild low ≥ parent disc → CUT VERTEXreport all cuts in one pass
One DFS finds every single point of failure: nodes (articulation points) and edges (bridges) whose removal disconnects the network.
