Sign inSign in

Dijkstra's algorithm greedy step

The step where a node outside SS with the minimum d∗(v)d^*(v) value is selected and added to SS.
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.

Graph representation1Greedy algorithm1Shortest path1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.