Pathfinding Algorithms
Grid SearchHardVisualize shortest path searches using BFS, Dijkstra, or A* heuristic grids.
Alt+Shift+P
Configuration Panel
Click on cells in the visualizer grid to build walls (obstacles) then click run to trace the route.
Pathfinder Visualizer Gridbfs
S
T
Start Target Wall Visited Path
Complexity Indices
Time ComplexityO(R * C log(R * C)) / O(R * C)
Auxiliary SpaceO(R * C) heap and structures space
Conceptual Overview
Pathfinding algorithms search coordinate graphs to calculate optimal routes. BFS finds unweighted shortest paths; Dijkstra scales this for weights; A* uses heuristics.
Source: CP-Algorithms reference guide