5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{bd6edbd4-1ec0-4c7e-bd39-b88f96bf52fb-5_588_1170_212_427}
\captionsetup{labelformat=empty}
\caption{Figure 5}
\end{figure}
[The weight of the network is 379]
Figure 5 represents the roads in a highland wildlife conservation park. The vertices represent warden stations. The number on each arc gives the length, in km , of the corresponding road.
During the winter months the park is closed. It is only necessary to ensure road access to the warden stations.
- Use Prim's algorithm, starting at A , to find a minimum connector for the network in Figure 5. You must state the order in which you include the arcs.
- Given that it costs \(\pounds 80\) per km to keep the selected roads open in winter, calculate the minimum cost of ensuring road access to all the warden stations.
At the end of winter, Ben inspects all the roads before the park re-opens. He needs to travel along each road at least once. He will start and finish at A, and wishes to minimise the length of his route.
- Use the route inspection algorithm to find the roads that will be traversed twice. You must make your method and working clear.
- Find the length of the shortest inspection route.
If Ben starts and finishes his inspection route at different warden stations, a shorter inspection route is possible.
- Determine the two warden stations Ben should choose as his starting and finishing points in order that his route has minimum length. Give a reason for your answer and state the length of the route.