For example, imagine an algorithm that’s designed to ... big effect on the overall runtime of the algorithm. Dijkstra’s paper used a simple data structure that left room for improvement.

It’s often assumed that Dijkstra ... simple route planning is not as daunting as TSP, there are some similarities, in that it involves a weighted, undirected graph, requiring the algorithm ...