ConceptTheory & Algos
Dijkstra's algorithm complexity
The running time of Dijkstra's algorithm determined by the number of insert, extract-min, and decrease-key operations performed on the priority queue.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.