ConceptTheory & Algos
All pairs shortest paths
The problem of finding the shortest path weights between all pairs of vertices in a directed graph.
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
3Each in their own terms, from the easiest level.
Ryan O'Donnell
The problem of finding the shortest path between all pairs of vertices in a graph.Barna Saha
The problem of finding shortest paths between all pairs of vertices in a weighted graph.
Lectures that assume it
1Connections
12The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Shortest path
- Graph
- Single-source shortest paths
- Dynamic all-pairs shortest paths
- Floyd-Warshall algorithm
- Graph radius