TEORI GRAF

“Kruskal’s Algorithm and Prim’s Algorithm”

Disusun Oleh:
Nama : Ikhwan Setyawan
NIM : 16.11.0298
Kelas : TI 16 D

PROGRAM STUDI TEKNIK INFORMATIKA

SEKOLAH TINGGI MANAJEMEN INFORMATIKA DAN KOMPUTER
PURWOKERTO
AMIKOM PURWOKERTO
PURWOKERTO
2017
Answer:
1. First Edge
Yorks – Leeds with 24 miles.

24 L

2. Second Edge
Yorks – Hulls with 37 miles.

H 37 24 L

Y
3. Third Edge
Bristol – Oxford with 74 miles.

H 37 24 L B
74

Y O

4. Fourth Edge
Bristol – Exeter with 84 miles.

H 37 24 L B
74 84

Y O E

5. Fifth Edge
Leeds – Oxford with 169 miles.

H 37 24 L 169 B
74 84

Y O E

This completes a spanning tree, which is a minimum spanning tree of

total miles 24 + 37 + 74 + 84 + 169 = 388.
Answer
a. Oxford
1. First Edge
Oxford – Bristol with 74 miles.
B
74

2. Second Edge
Bristol – Exeter with 84 miles.

B
74 84
O
O E
3. Third Edge
Leeds – Oxford with 169 miles.
Leeds – Oxford with 169 miles.

L 169 B
74 84

O E

4. Fourth Edge
Leeds – Leeds – Oxford with 169 miles.

24 L 169 B
74 84

Y O E
5. Fifth Edge
Leeds – Oxford with 169 miles.

H 37 24 L 169 B
74 84

Y O E

This completes a spanning tree, which is a minimum spanning tree of

total miles 74 + 84 + 169 + 24 + 37 = 388.