Pathfinding Algorithms
Explore and visualize popular pathfinding algorithms. Click on any algorithm to learn more and interact with its visualization.
A* Search
A* is an informed search algorithm that finds the shortest path efficiently using heuristics.
Dijkstra's Algorithm
Dijkstra's algorithm finds the shortest path in graphs with non-negative weights.
Breadth-First Search (BFS)
BFS explores nodes layer by layer and always finds the shortest path in unweighted graphs.
Depth-First Search (DFS)
DFS explores as deep as possible before backtracking. It does not always find the shortest path.