2.
| A | B | C | D | E | F |
| A | - | 85 | 110 | 160 | 225 | 195 |
| B | 85 | - | 100 | 135 | 180 | 150 |
| C | 110 | 100 | - | 215 | 200 | 165 |
| D | 160 | 135 | 215 | - | 235 | 215 |
| E | 225 | 180 | 200 | 235 | - | 140 |
| F | 195 | 150 | 165 | 215 | 140 | - |
The table shows the average journey time, in minutes, between six towns, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E }\) and F .
- Use Prim's algorithm, starting at A , to find a minimum spanning tree for this network. You must list the arcs that form your tree in the order in which you selected them.
- Draw your tree using the vertices given in Diagram 1 in the answer book.
- Find the weight of your minimum spanning tree.
Kruskal's algorithm may also be used to find a minimum spanning tree.
- State three differences between Prim's algorithm and Kruskal's algorithm.