9

9

JC,CD,CB,BH, HG,GF,BI,IE,H A

A

J,C,D,B,H,G,F,I, E,A

w(HA) = 15 2

Jadi dapat disimpulkan MST yang dihasilkan adalah MST = 1 + 1 + 1 + 2 + 2 + 2 + 2 + 2 + 2 = 15

1. Gunakan Algoritma Kruskal untuk menemukan minimum spanning tree pada gambar di bawah ini.

A

2 3 F

B

3 3

C 2 G 4 K

1 3 H

D

1 4

5

E 4 I

2 J 3 3

3 L 1
W terkecil W (T) 0 1 2 3 5 7 9 12 {} BF BF,CD BF,CD,KL BF,CD,KL,AB BF,CD,KL,AB,CG BF,CD,KL,AB,CG ,FJ BF,CD,KL,AB,CG ,FJ,JI BF,CD,KL,AB,CG ,FJ,JI,GH BF,CD,KL,AB,CG E’ Ket Inisialisas i

Iter asi ke 1 2 3 4 5 6 7 8 9

k 0 1 2 3 4 5 6 7 8 9

E dengan e terurut dari kecil BF,CD,KL,AB,CG,FJ,JI,GH,HL, AE,KJ,FG,BC,EI,GK,EF,HD CD,KL,AB,CG,FJ,JI,GH,HL,AE, KJ,FG,BC,EI,GK,EF,HD KL,AB,CG,FJ,JI,GH,HL,AE,KJ,F G,BC,EI,GK,EF,HD AB,CG,FJ,JI,GH,HL,AE,KJ,FG, BC,EI,GK,EF,HD CG,FJ,JI,GH,HL,AE,KJ,FG,BC, EI,GK,EF,HD FJ,JI,GH,HL,AE,KJ,FG,BC,EI,G K,EF,HD JI,GH,HL,AE,KJ,FG,BC,EI,GK, EF,HD GH,HL,AE,KJ,FG,BC,EI,GK,EF ,HD HL,AE,KJ,FG,BC,EI,GK,EF,HD AE,KJ,FG,BC,EI,GK,EF,HD

0 W(BF)= 1 W(CD) =1 W(KL)= 1 W(AB) =2 W(CG) =2 W(FJ)= 2 W(JI)=3

W(GH) 15 =3 W(HL)= 18

CG .HD FG.BC.EF.KL.JI.CD.HL.FJ.CD.FJ.GH.EI.GK.10 11 1 0 1 1 KJ.AE.GH.GH.K J .JI.FG.BC.JI.HD 3 W(AE)= 21 3 W(KJ)= 24 3 .FJ.AB.HL.CG .HL BF.EF.EI.KL.GK.AE BF.AB.

Sign up to vote on this title
UsefulNot useful