Sign inSign in

Correctness of Dijkstra's algorithm

The proof that the distance d′(v)d'(v) computed by Dijkstra's algorithm is indeed the shortest path distance from ss to vv.
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.

Dijkstra's algorithm1Non-negative edge weights1

Lecturers

1

    Connections

    2

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

    Concept1

    1 lecturer. 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.