题目
Problem
The table below shows the distances, in metres, between six vertices, A, B, C, D, E and F, in a network.
(a) Draw the weighted network using the vertices given in Diagram 1 in the answer book.
(b) 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.
(c) Draw the minimum spanning tree on Diagram 2 in the answer book and state its total weight.
(Total 7 marks)
题目中文翻译
下表显示了网络中六个顶点 A、B、C、D、E 和 F 之间的距离（单位：米）。
(a) 使用答案本中图 1 给出的顶点画出加权网络。
(b) 使用 Kruskal 算法找到网络的最小生成树。应按考虑顺序列出边，并说明是否将它们添加到最小生成树中。
(c) 在答案本的图 2 上画出最小生成树并写出其总权重。