Question

Question 3 (a) Find a minimal spanning tree for the following graph using Kruskal's algorithm, then calculate its weight. 15 24 A 15 C 8 12 7 B 12 15 J 10 10 7 D 14 16 5 H 11 I E 9 19 17 14 5 6 K 20 7 F G (i) Find a minimal spanning tree for the graph above using Kruskal's algorithm. (ii) Calculate its total weights.

          Question 3
(a) Find a minimal spanning tree for the following graph using Kruskal's algorithm, then
calculate its weight.
15
24
A
15
C
8
12
7
B
12
15
J
10
10
7
D
14
16
5
H
11
I
E
9
19
17
14
5
6
K
20
7
F
G
(i) Find a minimal spanning tree for the graph above using Kruskal's algorithm.
(ii) Calculate its total weights.

Question 3
(a) Find a minimal spanning tree for the following graph using Kruskal's algorithm, then
calculate its weight.
15
24
A
15
C
8
12
7
B
12
15
J
10
10
7
D
14
16
5
H
11
I
E
9
19
17
14
5
6
K
20
7
F
G
(i) Find a minimal spanning tree for the graph above using Kruskal's algorithm.
(ii) Calculate its total weights.

Added by Dustin H.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Michael Feffer

Step 1

The sorted edges are: 10, 14, 15. Show more…

Show all steps

Thanks for your feedback!

Question 3 (a) Find minimal spanning tree for the following graph using Kruskals algorithm, then calculate its weight: 15 10 14 Find a minimal spanning tree for the graph above using Kruskals algorithm Calculate its total weights.