Pathfinding Algorithm Visualizer

An interactive visualizer for four classic pathfinding algorithms — Breadth-First Search, Depth-First Search, Dijkstra, and A* — built in Unity (C#). Pick an algorithm and watch it explore the grid step by step until it reaches the goal.

Switch between two map types:

• Maze — uniform tiles with walls and a single correct path through.
• Terrain — no walls, but every tile has a movement cost; Dijkstra and A* find the cheapest path to the goal, not just any path.

Adjust the playback speed, toggle per-tile values, and use the side-by-side Compare mode to run two algorithms on identical maps and see which reaches the goal faster.

Features

• Four algorithms: BFS, DFS, Dijkstra, A*
• Two map modes: maze (walls) and weighted terrain (movement cost)
• Random map generation
• Adjustable visualization speed
• Side-by-side comparison with solve-time tracking
• Toggle to display each tile's distance/cost values