- Click within the grid and drag the mouse to draw walls.
- Drag the start and end node to any position.
- Choose an algorithm from the navigation panel.
- Click the Visualise algorithm button to see the algorithms in action.
- You can choose whether to traverse diagonally or not.
- In case of a-star algorithm you can choose heuristics involved for path finding.
- If non-diagonal traversal is selected Manhatten heuristic is advisable.