Codes for Dijkstra's shortest path algorithm. [DKSTR, SDKSTR, and USDKST, for CDC 6600]
Bernie L. Hulme, John A. Wisniewski · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1978
This report is a users guide to three subroutines for finding shortest paths in a graph. The three codes, DKSTR, SDKSTR, and USDKST, all implement Dijkstra's method as modified by Yen. They differ in their data structures, since DKSTR is intended for general use, while SDKSTR is intended for sparse graphs and USDKST is tailored to undirected sparse graphs. Because of its speed and its potential for great storage savings in applied problems where the graphs tend to be large and sparse, SDKSTR is seen to be the most useful of these codes.