Post cool articles relevant to the project here! - dcobbley/AlgorithmsProject350 GitHub Wiki
Cool Shit for Dijkstras and Bellman-Ford
Post links or paste the text here. Separate with a header to make it easier to read.
A Review And Evaluations Of Shortest Path Algorithms
http://www.ijstr.org/final-print/june2013/A-Review-And-Evaluations-Of-Shortest-Path-Algorithms.pdf
Improved shortest path algorithms for nearly acyclic graphs. (uses Dijkstra's)
http://www.sciencedirect.com.proxy.lib.pdx.edu/science/article/pii/S0304397502006138#
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. (Bellman-Ford)
http://www.sciencedirect.com.proxy.lib.pdx.edu/science/article/pii/S0196677403000464