Lecture
This lecture covers the Bellman-Ford algorithm for finding the shortest paths in a graph with edge weights, including the proof of correctness and detection of negative cycles. It also introduces Dijkstra's algorithm, a faster alternative for nonnegative weights, with a focus on implementation and running time analysis.