strongly-connected-components #

Shows directed-path reachability (u ->* v) by animating highlighted paths, then flips direction to demonstrate mutual reachability. Finally, it outlines SCCs as equivalence classes (a partition of vertices), making the “maximal strongly connected sets” visually explicit.

canvasclick to interact

⏮◀◀▶▶STEP0.25x1xZOOM

t=0s

practical uses #

01.Finding cycles/feedback loops in dependency graphs (build systems, package managers)
02.Deadlock detection and analysis in wait-for/resource graphs
03.Program analysis and optimization (control-flow graphs, call graphs, component condensation DAG)

technical notes #

Uses a fixed small directed graph with 3 SCCs. Each cycle (~4.2s) animates BFS-derived shortest paths for u ->* v then v ->* u, and finally draws bounding boxes per SCC. Grid snapping and square nodes/arrows create a blocky green-on-black aesthetic; scale is responsive via Math.min(w,h)/baseSize.

← proof-techniques rate-distortion-theory →