Pathfinding (A*, Dijkstra)

An interactive grid for BFS, DFS, Dijkstra, A* and greedy best-first. Generate a maze, move the start and goal, and compare how many cells each explores.

Try also

• Sorting algorithms: Bubble, insertion, merge, quick and heap sort, animated step by step.