ConceptTheory & Algos
Dynamic all-pairs shortest paths
Maintaining shortest path distances between all pairs of vertices in a graph undergoing edge updates.
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.
All pairs shortest paths1Dynamic graph algorithms1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.