AlgoFlow.

The problem

Pathfinding and graph algorithms are hard to understand from static explanations because traversal order, frontier growth, weights, memory use, shortest-path guarantees, and the final route all stay hidden.

The approach

• Visualized each algorithm's changing state through current, frontier, visited, and path layers, helping learners understand the search process instead of only seeing the answer.
• Paired animated runs, step-through controls, and side-by-side comparison so learners can slow down confusing moments or compare algorithms on matching inputs.
• Combined editable walls, draggable endpoints, maze presets, graph edge weights, and algorithm notes into a sandbox for testing why each algorithm behaves differently.

The outcome

• Shows visited nodes, path length, target status, shortest-path guarantees, time complexity, and space complexity so learners can compare both behavior and tradeoffs.
• Gives learners a hands-on way to test custom grids, generated mazes, graph weights, and algorithm choices instead of relying on static diagrams.