• The first two left clicks on the board initialize start and end node
• Click or click and drag to create obstacles
• Press space bar and see the algorithm takes off!

• BFS
• DFS
• ASTAR (A*)

Breadth First Search is unweighted and guarantee a optimal path.

Depth First Search is unweighted and does not guarantee a optimal path.

A* is weighted and guarantee a optimal path.