The goal of this semestral work is to replicate some of the functionality of this algorithm visualiser in elm
The supporting functionality will be:
- creating and modyfing the grid with wall nodes, and the start and end nodes.
- visualising 3 main path finding algorithms - BFS, DFS and Dijkstra
- setting the speed of the visualisation
- yarn
Install yarn dependencies using
yarn
Running
yarn build
Builds the project into the dist directory.
Running
yarn serve
launches the development server with hot module reloading.