Graph Traversal / Connected Components / Flood Fill
These visualizers focus on how traversal explores connected structure: cells in a grid, weighted variable graphs, directed prerequisite graphs, and general graph nodes linked by adjacency lists.
Trace the Clone Graph algorithm from parsed input through each decision point.
Trace the Course Schedule II algorithm from parsed input through each decision point.
Trace the Course Schedule algorithm from parsed input through each decision point.
Trace the Evaluate Division algorithm from parsed input through each decision point.
Trace the Number of Islands algorithm from parsed input through each decision point.
Trace the Surrounded Regions algorithm from parsed input through each decision point.