Sign inSign in

Dijkstra's algorithm

An algorithm for finding the shortest paths between nodes in a graph with non-negative edge weights.
as Erik Demaine defines itMITThe wording closest to all 4 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

4

Each in their own terms, from the easiest level.

  • UC Davis Academics

    UC Davis · Undergraduate

    An algorithm for computing the shortest distance from a fixed initial node s to every other node v in a directed graph with non-negative edge lengths.
    • 0:08Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
  • Srini Devadas

    MIT · Undergraduate

    A greedy algorithm that finds the shortest paths from a source vertex to all other vertices in a graph with non-negative edge weights.
    • 27:13Dijkstra's Algorithm: Greedy Single-Source Shortest Paths
  • Han Huang

    MIT · Research

    An algorithm for finding the shortest paths between nodes in a graph.
    • 9:34Recovering Riemannian Metric Distance from Random Geometric Graphs

Lectures that assume it

5

Connections

19

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

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