Prim's Algorithm for MST B 26(9) Step 1:V=(A),E= 27 21(4) Step 2:Select the nearest 42 E neighbor of V,u,add the 36 29 D edge connecting u and 34 25(1) 33 22 16(7) some vertex in V into E 18(2) 21(8) Step 3:Repeat step 2 until E H 21(5) 25(6) contains n-1 edges 28 17(3) End of Algorithm 53Prim’s Algorithm for MST 27 26(9) 42 21(4) 21(8) 53 25(6) 33 28 36 18(2) 17(3) 34 29 22 A I H J C E B G F D 16(7) 21(5) 25(1) Step 1: V={A}, E={} Step 2: Select the nearest neighbor of V, u, add the edge connecting u and some vertex in V into E Step 3: Repeat step 2 until E contains n-1 edges End of Algorithm