Bellman-Ford algorithm, shortest paths in direct acyclic graphs, Dijsktra’s algorithm.
Understand when, why, and how to use single source shortest paths.
Properties of the problem, supporting algorithms
Screencast Suthers 19 min
Dijkstra’s algorithm
Screencast Suthers 20 min
Bellman-Ford algorithm, SSSP in directed acyclic graphs, Dijkstra’s algorithm
Textbook 20 pages
Minimum spanning trees, shortest path, dense paths, geometric problems
Textbook 14 pages
Shortest paths problem, Bellman-Ford algorithm, Shortest paths in a DAG, Dijkstra’s algorithm
Notes
Playing with Bellman-Ford, Dijkstra’s algorithm, and DAGs
Homework