The authors of this article explains and using experiment to illustrate how the shortest path algorithm (Dijkstra algorithm) and the more complicated “out-of-kilter” algorithm fits in the field of network analysis. Although the article is written in 1992, it still provide the basic knowledge to those who are not familiar with network analysis before. It also reflects the most basic level algorithm for nowadays more advanced network analysis algorithm.
One thing that catches my notice throughout the whole article, is that although the “out-of-kilter” algorithm the article mainly tested focus on shortest path, in realistic application, I would argue the time efficiency are way more important than the distance between two routes, in the case of emergency evacuation. As the authors discusses, however, more factors are indeed needed to perform a network analysis that considers time efficiency, such as peak hours, route capacity, means of transportation, slope, landscape etc..
Another important issue from this 1992 article about network analysis is the limitation of computing power and technological foresight. Due to the computing power limit, only simple shortest path between nodes can be compute in euclidean distance, which in most of the case, will hit obstacle in real-life practice, due to multiple physical, social, and cultural barrier. The issue with technological foresight is that although network analysis itself does not necessarily require geographical coordinate to perform. Or in other words, network analysis itself is not limited by geographic coordinate system or projection. However, nowadays, when we apply network analysis on more advanced use, like GPS tracking, navigation, even real-time traffic monitoring/dispatch, the geographic side of network analysis just cannot be totally ignored, and sometimes rather necessary.