The table below shows the distances, in metres, between six vertices, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E }\) and F , in a network.
A
B
C
D
E
F
A
-
18
23
17
28
19
B
18
-
20
11
-
24
C
23
20
-
-
25
13
D
17
11
-
-
-
22
E
28
-
25
-
-
-
F
19
24
13
22
-
-
Draw the weighted network using the vertices given in Diagram 1 in the answer book.
Use Kruskal's algorithm to find a minimum spanning tree for the network. You should list the edges in the order that you consider them and state whether you are adding them to your minimum spanning tree.
Draw the minimum spanning tree on Diagram 2 in the answer book and state its total weight.