It’s often assumed that Dijkstra’s algorithm ... speeds up the search for a route that’s not necessarily the shortest, but also the fastest. By preprocessing the graph, unimportant vertices ...