3.
| A | B | C | D | E | F |
| A | - | 15 | 6 | 9 | - | - |
| B | 15 | - | 12 | - | 14 | - |
| C | 6 | 12 | - | 7 | 10 | - |
| D | 9 | - | 7 | - | 11 | 17 |
| E | - | 14 | 10 | 11 | - | 5 |
| F | - | - | - | 17 | 5 | - |
The table shows the times, in days, needed to repair the network of roads between six towns, A, B, C, D, E and F, following a flood.
- Use Prim's algorithm, starting at A , to find the minimum connector for this network. You must list the arcs that form your tree in the order that you selected them.
- Draw your minimum connector using the vertices given in Diagram 1 in the answer book.
- Add arcs from D, E and F to Diagram 2 in the answer book, so that it shows the network of roads shown by the table.
- Use Kruskal's algorithm to find the minimum connector. You should list the arcs in the order in which you consider them. In each case, state whether you are adding the arc to your minimum connector.
- State the minimum time needed, in days, to reconnect the six towns.