Sign inSign in

Bellman-Ford algorithm

An algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph supporting negative edge weights.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Srini Devadas

    MIT · Undergraduate

    An algorithm that computes shortest paths from a single source vertex to all other vertices in a weighted digraph, handling negative edge weights and detecting negative cycles.

Lectures that assume it

2

Connections

12

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

2 lecturers. 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.