Prim's Algorithm (Edexcel A-Level Further Mathematics): Quizzes

Find minimum spanning tree

Adds smallest connecting edge to MST

When graph is represented as a matrix

When all vertices are included in MST

No edge exists between $i$ and $j$

$O(v^2)$

$O(v^2)$

$v-1$ edges

$\infty$ or $0$

11