Dijkstra Pathfinder 🤘🏻

This is a 'Having fun' 🤓 project that uses Dijkstra Algorithm to find the shortest path between two points.

Live demo

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

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
dist		dist
src		src
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
package-lock.json		package-lock.json
package.json		package.json
tsconfig.json		tsconfig.json
webpack.config.js		webpack.config.js