This routing service requires a latitude and longitude input for two locations to calculate the shortest route in between. The routing is based on the Dijkstra algorithm.
-
Updated
Nov 8, 2018 - Java
This routing service requires a latitude and longitude input for two locations to calculate the shortest route in between. The routing is based on the Dijkstra algorithm.
Port of the NEIC 'TTimes' libraries from FORTRAN77 to Java
Add a description, image, and links to the travel-times topic page so that developers can more easily learn about it.
To associate your repository with the travel-times topic, visit your repo's landing page and select "manage topics."