Graph BFS / Shortest Path / Layered Search
These visualizers show breadth-first search when the graph is not a plain adjacency list: board jumps, genetic mutation states, and word transformations all become layered shortest-path stories.
Trace the Minimum Genetic Mutation algorithm from parsed input through each decision point.
Trace the Snakes and Ladders algorithm from parsed input through each decision point.
Trace the Word Ladder algorithm from parsed input through each decision point.