An app using Dijkstra algorithm to find the shortest path between different cities.
https://dijkstra.ruihildt.xyz
84ff531a9a
Bumps [acorn](https://github.com/acornjs/acorn) from 5.7.3 to 5.7.4. - [Release notes](https://github.com/acornjs/acorn/releases) - [Commits](https://github.com/acornjs/acorn/compare/5.7.3...5.7.4) Signed-off-by: dependabot[bot] <support@github.com> |
||
---|---|---|
public | ||
src | ||
.gitignore | ||
package-lock.json | ||
package.json | ||
README.md | ||
yarn.lock |
dijkstra-frontend
Find the the shortest path between different cities in Belgium with Dijkstra algorithm.
-
Frontend: https://dijkstra.ruihildt.xyz/
-
Backend Source: https://github.com/ruihildt/dijkstra/