Quick background for Bellman-Ford, Single-Source Shortest Paths for DAGs (directed acyclic graphs) and Dijkstra's.
Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.
