ConceptTheory & Algos
Prim's algorithm running time
The running time of Prim's algorithm is the same as Dijkstra's algorithm, expressed as when using Fibonacci heaps.
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.