Once the user chooses a location, it's time for the routing engine to plot the fastest and most direct route to the destination. This requires a very sophisticated algorithm that can juggle many variables at once: types of roads (one-lane vs. highway), speed limits, stop lights, turns, ...
In response to user selection of a departure point and at least one destination point, the routing component 46 determines a travel route between the departure point and the destination point using an implementation of Dijkstra's shortest path algorithm. In order to apply Dijkstra's algorithm, a...