Sign inSign in

Bellman-Ford algorithm corollary

If after ∣V∣−1|V|-1 passes an edge can still be relaxed, the current shortest path is not simple and contains a negative weight cycle.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.