Shortest Path Algorithms: A Comparison
Author(s)Golden, Bruce L., 1950-
In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.
Massachusetts Institute of Technology, Operations Research Center
Operations Research Center Working Paper;OR 044-75