2.
| \(\mathbf { A }\) | \(\mathbf { B }\) | \(\mathbf { C }\) | \(\mathbf { D }\) | \(\mathbf { E }\) | \(\mathbf { F }\) |
| \(\mathbf { A }\) | - | 24 | - | - | 23 | 22 |
| \(\mathbf { B }\) | 24 | - | 18 | 19 | 17 | 20 |
| \(\mathbf { C }\) | - | 18 | - | 11 | 14 | - |
| \(\mathbf { D }\) | - | 19 | 11 | - | 13 | - |
| \(\mathbf { E }\) | 23 | 17 | 14 | 13 | - | 21 |
| \(\mathbf { F }\) | 22 | 20 | - | - | 21 | - |
The table shows the distances, in metres, between six vertices, \(\mathbf { A } , \mathbf { B } , \mathbf { C } , \mathbf { D } , \mathbf { E }\) and \(\mathbf { F }\), in a network.
- Draw the weighted network using the vertices given in Diagram 1 in the answer booklet.
- Use Kruskal's algorithm to find a minimum spanning tree. 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 your tree on Diagram 2 in the answer booklet and find its total weight.