|------Pathfinding Algorithms Sample | Instructions------|
INPUT DESCRIPTION 1 Key: Load BFS (Breadth-first Search) 2 Key: Load Dijkstra 3 Key: Load Greedy 4 Key: Load A* F1 Key: Load A* (Multitarget) Space Key: On/Off Walls Render
On console, a debugger is shown with data corresponding to the last algorithm used. Minimum and maximum nodes explored are logged and accumulated between simultaneous executions of the same algorithm.
You can reset the debugger completely pressing 'R'.
Unzip and execute SDL_Pathfinding.exe
