What it does

The app lets users place a start node, end node, walls, weights, and bombs on a grid, then run pathfinding algorithms to see how each one scans the board and builds a path.

Algorithms and mazes

It includes BFS, DFS, Dijkstra, A*, Greedy BFS, Swarm, Convergent Swarm, and Bidirectional Swarm, along with recursive division, random wall mazes, and random weight mazes.

Interaction details

Users can drag start, end, and bomb nodes, draw walls or weights, adjust animation speed, clear specific board layers, and watch visited cells darken while the final path is highlighted in yellow with moving arrows.

What I learned

This project strengthened my understanding of graph traversal, weighted pathfinding, maze generation, animation timing, and keeping a complex grid UI responsive while many cells update in sequence.