Reading this article is quite timely for me, as my final project in GEOG 506 will involve a bit of network analysis and I plan to use Dijkstra’s algorithm. It’s really interesting to read Dunn and Newton’s paper and their “out of kilter” algorithm, considering it is from 1992; you can tell from what they say that network analysis was nowhere near where it is today. For example, they discuss how “one of the most difficult concepts to incorporate realistically into a system… is that of temporal change… roadworks have daily, weekly, or monthly lifetimes, for instance, while congestion varies hourly” (Dunn & Newton 265). Today, there are programs like Google Maps and Waze that have, to varying degrees of success, taken on this issue of temporality in network analysis. Dunn and Newton pose an additional problem in network analysis that has been increasingly solved in modern studies: “it is perhaps pertinent to ask whether even highly sophisticated network algorithms may ever replace local knowledge and intuition, not least in emergency situations where judgement is of the essence” (Dunn & Newton 265). When I took GEOG 307 last semester, we read “Flaming to the Scene,” a paper in which the authors use location-allocation and network analyses to determine the best routes for firetrucks to take to a fire. They did this successfully, as their algorithm was implemented by the Regina fire department and decreased the average time trucks took to arrive to the scene of a fire. Therefore, it appears that many of the challenges in weighted network analyses brought up in this paper have been resolved.