Bellman-Ford pattern

After V−1 passes every simple shortest path is represented. A further improvement proves a negative cycle.

Difficulty: Medium · Approach: Visible frontier and visited order

This is a public lesson preview. Sign in with a Lifetime Pass to open the protected animation, solution, and code.