A label-setting algorithm for calculating shortest path trees in sparse networks

Shortest path analysis is a major analytical component of numerous quantitative transportation and communication models. Because of this, a number of algorithms have been developed for finding the shortest paths from one node to all other nodes in large sparse directed networks. This paper presents a labeling technique, an implementation of the general label-setting method. The study shows the correctness and the efficiency of the proposed method. In addition, we present computational results for random networks.