Desktop application that allows you to find and visualize the shortest path between two points on a map.
Implemented with Kotlin, JavaFX and GMapsFX.
Source code is available on GitHub.
Available algorithms:
- BFS
- Dijkstra
- A*
-->
Desktop application that allows you to find and visualize the shortest path between two points on a map.
Implemented with Kotlin, JavaFX and GMapsFX.
Source code is available on GitHub.
Available algorithms: