This is a 'Having fun' ๐ค project that uses Dijkstra Algorithm to find the shortest path between two points.
soon! ๐
Target | Keyboard | Action |
---|---|---|
Run Dijkstra | R | it will run the algorithm |
Change Mode | M | it will change the mode to clean (erase walls) or draw |
Clear Board | C | it will remove all the walls and restart the board |