Struktur Data (SAK 1107)
Tutorial 8
JAWAPAN


![]()
![]()
![]()
![]()
![]()
![]()

![]()







Berikan;
|
|
a
b c d e f g h I j |
|
a |
0
0 1 1 1 1 0 0 0 0 |
|
b |
0
0 0 0 0 0 0 0 0 0 |
|
c |
0
1 0 0 0
0 0 0 0 0 |
|
d |
0
0 0 0 0 0 0 0 1 0 |
|
e |
0
0 0 1 0 0 0
1 0 0 |
|
f |
0
0 0 0 0 0 0 0 0 0 |
|
g |
0
0 0 0 0 0 0 0 0 0 |
|
h |
0
0 0 0 0 0 0 0 0 1 |
|
i |
0
0 0 0 0 0 0 0 0 0 |
|
J |
0
0 0 0 0 0 0
0 0 0 |
A B C
D E F
G
(C,B) (A,C) (A,D) (A,F)
(A,E) (E,G) (E,H) (H,D) (H,J) (D,I)
A C B
(A E H D I)
(I D A C B)
F E D C![]()
![]()
![]()
![]()
![]()
A
![]()
B
![]()
C
![]()
D
![]()
![]()
![]()
E
![]()
F
![]()
G
![]()
H
![]()
I
![]()
![]()
J
i.
Penyusunan/
carian dalam dahulu (depth-first search) bermula bucu A
ii penyusuran / carian lebar dahulu
(breadth-first search) bermula bucu A
Lakarkan graf
bagi matriks kejiranan dibawah:
|
|
A |
B |
C |
D |
|
A |
0 |
1 |
1 |
1 |
|
B |
1 |
0 |
0 |
1 |
|
C |
1 |
0 |
0 |
0 |
|
D |
1 |
1 |
0 |
0 |


i. Binakan matriks kejiranan dan senarai kejiranan
|
|
0
1 2 3 4 5 |
|
0 |
0
1 0 1 0
0 |
|
1 |
0
0 0 0 1 0 |
|
2 |
0
0 0 0 0
0 |
|
3 |
0
1 0 0 0 0 |
|
4 |
0
0 1 0 0 0 |
|
5 |
0
0 1 0 0 0 |
![]()
![]()
![]()
![]()
![]()
![]()
0
![]()
1
![]()
2
![]()
3
![]()
4
![]()
5
3. Diberikan
tepi nilai jarak bagi suatu graf berarah seperti berikut:-
Tepi Jarak
(1,2) 30
(1,4) 50
(1,5) 40
(1,6) 100
(2,3) 40
(3,5) 10
(3,6) 30
(4,3) 10
(5,4) 20
(5,6) 70
Lukiskan bentuk graf tersebut:-

30

![]()

100
40

40 50
30 70
10




![]()
![]()


![]()
10
20