Name: Lecture 12: Bellman-Ford
Uploaded: 2021-09-13T16:20:05Z
Duration: 57 min 40 s
Description: This lecture introduces a single source shortest path algorithm that works for general graphs. The process, correctness, and running time of the Bellman-Ford algorithm is discussed. Instructor: Jason Ku

57:40

This lecture introduces a single source shortest path algorithm that works for general graphs. The process, correctness, and running time of the Bellman-Ford algorithm is discussed.

Instructor: Jason Ku