Nama : Arif Ardiyansah

Nim : 202057019

Take Home

The network in Figure 1 gives the distances in miles between pairs of cities 1, 2, …, and 8. Use
Dijkstra’s algorithm to find the shortest route between the following cities:
a. Cities 1 and 7.
b. Cities 1 and 6.
c. Cities 4 and 8.
d. Cities 2 and 7.

Jawab :

JAWABAN A DAN B

Iterasi 1

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Sementara
3 [0+2, 1] = [2, 1] Sementara
Iterasi 2

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [ 2, 2] Sementara
4 [1+5, 2] = [6, 2] Sementara
5 [1+2, 2] = [3, 2] Sementara

Iterasi 3

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [ 2, 2] Permanen
4 [1+5, 2] = [6, 2] atau [2+2, 3] = [4, 3] Sementara
5 [1+2, 2] = [3, 2] atau [2+1, 3] = [3, 3] Sementara
6 [2+4, 3] = [6, 3] Sementara
Iterasi 4

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [ 2, 2] Permanen
4 [1+5, 2] = [6, 2] atau [2+2, 3] = [4, 3] Sementara
5 [1+2, 2] = [3, 2] atau [2+1, 3] = [3, 3] Permanen
6 [2+4, 3] = [6, 3] atau [3+3, 5] = [6, 5] Sementara
7 [3+7, 5] = [10, 5] Sementara

Iterasi 5

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [ 2, 2] Permanen
4 [2+2, 3] = [4, 3] Permanen
5 [1+2, 2] = [3, 2] atau [2+1, 3] = [3, 3] Permanen
[2+4, 3] = [6, 3] atau [3+3, 5] = [6, 5] atau [6+6, 4] = [12, 4] atau
6 Sementara
[4+6, 4] = [10, 4]
7 [3+7, 5] = [10, 5] atau [6+8, 4] =[14, 4] atau [4+8, 4] = [12, 4] Sementara
Iterasi 6

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [ 2, 2] Permanen
4 [2+2, 3] = [4, 3] Permanen
5 [1+2, 2] = [3, 2] atau [2+1, 3] = [3, 3] Permanen
6 [2+4, 3] = [6, 3] atau [3+3, 5] = [6, 5] Permanen
[3+7, 5] = [10, 5] atau [6+8, 4] =[14, 4] atau [4+8, 4] = [12, 4] atau [6+5, 6]
7 Sementara
= [12, 6]
8 [6+2, 6] = [8, 6] Sementara

Iterasi 7

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [ 2, 2] Permanen
4 [2+2, 3] = [4, 3] Permanen
5 [1+2, 2] = [3, 2] atau [2+1, 3] = [3, 3] Permanen
6 [2+4, 3] = [6, 3] atau [3+3, 5] = [6, 5] Permanen
[3+7, 5] = [10, 5] atau [6+8, 4] =[14, 4] atau [4+8, 4] = [12, 4] atau
7 Sementara
[6+5, 6] = [12, 6]
8 [6+2, 6] = [8, 6] Permanen
Iterasi 8

Node Label Status

1 [0,-] Permanen
2 [0+1, 1] = [1, 1] Permanen
3 [0+2, 1] = [2, 1] atau [1+1, 2] = [2, 2] Permanen
4 [2+2, 3] = [4, 3] Permanen
5 [1+2, 2] = [3, 2] atau [2+1, 3] = [3, 3] Permanen
6 [2+4, 3] = [6, 3] atau [3+3, 5] = [6, 5] Permanen
7 [3+7, 5] = [10, 5] Permanen
8 [6+2, 6] = [8, 6] Permanen
a. Rute terpendek dari kota 1 ke kota 7 adalah 1-2-5-7 atau 1-3-5-7 atau 1-2-3-5-7
dengan total jarak sejauh 10 mil
b. Rute terpendek dari kota 1 ke kota 6 adalah 1-3-6 atau 1-3-5-6 atau 1-2-5-6 atau 1-2-
3-6 atau 1-2-3-5-6 dengan total jarak sejauh 6 mil
JAWABAN C

Iterasi 1

Node Label Status

4 [0,-] Permanen
5 [0+3, 4] = [3, 4] Sementara
6 [0+6, 4] = [6, 4] Sementara
7 [0+8, 4] = [8, 4] Sementara

Iterasi 2

Node Label Status

4 [0,-] Permanen
5 [0+3, 4] = [3, 4] Permanen
6 [0+6, 4] = [6, 4] atau [3+3, 5] = [6, 5] Sementara
7 [0+8, 4] = [8, 4] atau [3+7, 5] = [10, 5] Sementara
Iterasi 3

Node Label Status

4 [0,-] Permanen
5 [0+3, 4] = [3, 4] Permanen
6 [0+6, 4] = [6, 4] atau [3+3, 5] = [6, 5] Permanen
7 [0+8, 4] = [8, 4] atau [3+7, 5] = [10, 5] atau [6+5 ,6] = [11, 6] Sementara
8 [6+2, 6] = [8, 6] Sementara

Iterasi 4

Node Label Status

4 [0,-] Permanen
5 [0+3, 4] = [3, 4] Permanen
6 [0+6, 4] = [6, 4] atau [3+3, 5] = [6, 5] Permanen
7 [0+8, 4] = [8, 4] Permanen
8 [6+2, 6] = [8, 6] atau [8+6, 7] = [14, 7] atau [10+6, 7] = [16, 7] Sementara
Iterasi 5

Node Label Status

4 [0,-] Permanen
5 [0+3, 4] = [3, 4] Permanen
6 [0+6, 4] = [6, 4] atau [3+3, 5] = [6, 5] Permanen
7 [0+8, 4] = [8, 4] Permanen
8 [6+2, 6] = [8, 6] Permanen
Jadi, rute terpendek dari kota 4 ke kota 7 adalah 4-6-8 atau 4-5-6-8 dengan total
jarak sejauh 8 mil
JAWABAN D

Iterasi 1

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Sementara
4 [0+5, 2] = [5, 2] Sementara
5 [0+2, 2] = [2, 2] Sementara

Iterasi 2

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Permanen
4 [0+5, 2] = [5, 2] atau [1+2, 3] = [3, 3] Sementara
5 [0+2, 2] = [2, 2] atau [1+1, 3] = [2, 3] Sementara
6 [1+4, 3] = [5, 3] Sementara
Iterasi 3

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Permanen
4 [0+5, 2] = [5, 2] atau [1+2, 3] = [3, 3] Sementara
5 [0+2, 2] = [2, 2] atau [1+1, 3] = [2, 3] Permanen
6 [1+4, 3] = [5, 3] atau [2+3, 5] = [5, 5] Sementara
7 [2+7, 5] = [9, 5] Sementara

Iterasi 4

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Permanen
4 [0+5, 2] = [5, 2] atau [1+2, 3] = [3, 3] Permanen
5 [0+2, 2] = [2, 2] atau [1+1, 3] = [2, 3] Permanen
6 [1+4, 3] = [5, 3] atau [2+3, 5] = [5, 5] atau [3+6, 4] = [10, 4] Sementara
7 [2+7, 5] = [9, 5] atau [3+8, 4] = [11, 4] Sementara
Iterasi 5

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Permanen
4 [0+5, 2] = [5, 2] atau [1+2, 3] = [3, 3] Permanen
5 [0+2, 2] = [2, 2] atau [1+1, 3] = [2, 3] Permanen
6 [1+4, 3] = [5, 3] atau [2+3, 5] = [5, 5] Permanen
7 [2+7, 5] = [9, 5] atau [3+8, 4] = [11, 4] Sementara
atau [5+5, 6] = [10, 6]
8 [5+2, 6] = [7, 6] Sementara

Iterasi 6

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Permanen
4 [0+5, 2] = [5, 2] atau [1+2, 3] = [3, 3] Permanen
5 [0+2, 2] = [2, 2] atau [1+1, 3] = [2, 3] Permanen
6 [1+4, 3] = [5, 3] atau [2+3, 5] = [5, 5] Permanen
7 [2+7, 5] = [9, 5] atau [3+8, 4] = [11, 4] atau [5+5, 6] = [10, 6] Sementara
8 [5+2, 6] = [7, 6] Permanen
Iterasi 7

Node Label Status

2 [0,-] Permanen
3 [0+1, 2] = [1, 2] Permanen
4 [0+5, 2] = [5, 2] atau [1+2, 3] = [3, 3] Permanen
5 [0+2, 2] = [2, 2] atau [1+1, 3] = [2, 3] Permanen
6 [1+4, 3] = [5, 3] atau [2+3, 5] = [5, 5] Permanen
7 [2+7, 5] = [9, 5] Permanen
8 [5+2, 6] = [7, 6] Permanen

Jadi, rute terpendek dari kota 2 ke kota 7 adalah 2-5-7 atau 2-3-5-7 dengan total
jarak sejauh 9 mil
 2. Dibandingkan dengan metode Djikstra, apa keunggulan dan kelemahan metode Floyd?

Jawab :

1.
2.