Skip
Prev
Next
Algorithm:
Dijkstra
Uninformed Search
Breath First Search
Depth First Search
Dijkstra
Informed Search
A*
Bidirectional A*
Run
Speed:
No Animation
Fast
Average
Slow
Clear Board
Clear Path
Start Node
Wall Node
Visited Node
Path Node
Target Node