ConceptTheory & Algos
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.
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.
Adjacency list1Dynamic programming1Edge relaxation1General edge weights1Graph relaxation1Shortest path1Shortest path problem1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Srini Devadas
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
2Connections
12The lectures that define it or assume it, and the concepts next to it.