First page
Back
Continue
Last page
Graphics
Prim's – example (cont)
Now the candidates are
(a,b), (b,c)
and
(b,e)
(a,b)
is smallest so that is added completing the minimum spanning tree.