2.
\begin{table}[h]
| A | B | C | D | E | F | G | H |
| A | - | 34 | 29 | 35 | 28 | 30 | 37 | 38 |
| B | 34 | - | 32 | 28 | 39 | 40 | 32 | 39 |
| C | 29 | 32 | - | 27 | 33 | 39 | 34 | 31 |
| D | 35 | 28 | 27 | - | 35 | 38 | 41 | 36 |
| E | 28 | 39 | 33 | 35 | - | 36 | 33 | 40 |
| F | 30 | 40 | 39 | 38 | 36 | - | 34 | 39 |
| G | 37 | 32 | 34 | 41 | 33 | 34 | - | 35 |
| H | 38 | 39 | 31 | 36 | 40 | 39 | 35 | - |
\captionsetup{labelformat=empty}
\caption{Table 1}
\end{table}
Table 1 represents a network that shows the travel times, in minutes, between eight towns, A, B, C, D, E, F, G and H.
- Use Prim's algorithm, starting at A , to find the minimum spanning tree for this network. You must clearly state the order in which you select the edges of your tree.
- State the weight of the minimum spanning tree.
\begin{table}[h]
| \cline { 2 - 9 }
\multicolumn{1}{c|}{} | A | B | C | D | E | F | G | H |
| J | 33 | 37 | 41 | 35 | \(x\) | 40 | 28 | 42 |
\captionsetup{labelformat=empty}
\caption{Table 2}
The journey time between towns E and J is \(x\) minutes where \(x > 28\)
A salesperson needs to visit all of the nine towns, starting and finishing at J. The salesperson wishes to minimise the total time spent travelling. - Starting at J, use the nearest neighbour algorithm to find an upper bound for the duration of the salesperson's route. Write down the route that gives this upper bound.
Using the nearest neighbour algorithm, starting at E, an upper bound of 291 minutes for the salesperson's route was found.
- State the best upper bound that can be obtained by using this information and your answer to (c). Give the reason for your answer.
Starting by deleting J and all of its arcs, a lower bound of 264 minutes for the duration of the salesperson's route was found.
- Determine the value of \(x\). You must make your method and working clear.