Lecture 08: Bellman–Ford and Shortest Paths in DAGs

Content locked

The catalog is public. Reading this content requires approved access.

Announcements

From BFS to weighted shortest paths

Negative-cycle example

Relaxation: improve one estimate

Bellman–Ford

Example: edge order affects how fast information travels

Why n-1 rounds suffice

Reachable negative cycles

Version 1: detect a cycle

Version 2: mark every affected distance as -\infty

DAG shortest paths: one ordered pass

In-class exercise