Sign inSign in

All pairs shortest paths

The problem of finding the shortest path weights between all pairs of vertices in a directed graph.
as Erik Demaine defines itMITThe wording closest to all 3 definitions
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

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The problem of finding the shortest path between all pairs of vertices in a graph.
  • Barna Saha

    UC Berkeley · Graduate

    The problem of finding shortest paths between all pairs of vertices in a weighted graph.
    • 5:26Efficient Fine-Grained Algorithms

Lectures that assume it

1

Connections

12

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

3 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.