We summarize the currently best known theoretical results for the single-source shortest paths problem for directed graphs with non-negative edge weights. We also point out that a recent result due to Cherkassky, Goldberg and Silverstein (1996) leads to even better time bounds for this problem than claimed by the authors.
/lp/association-for-computing-machinery/recent-results-on-the-single-source-shortest-paths-problem-F2bonFwHud