Path Planning

Dijkstras vs A*

Final visualization of the nodes and edges identified in the search + the most optimal path.

Dijkstra's Algorithm	A* Search

---

DFS example

Static Path Result

Final visualization of the nodes and edges identified in the search.

---

Exploration Animation

Step-by-step visualization of the DFS exploration and backtracking process.