Loading

Introduction to Algorithms: Bellman-Ford

Bellman-Ford

This lecture reviews shortest path notation, considers a generic shortest path algorithm, and then describes and proves the Bellman-Ford algorithm, which can handle graphs with negative cycles.