4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{0fdc5a3c-97e7-46e3-a57c-45a13755f0e5-4_782_1118_246_424}
\captionsetup{labelformat=empty}
\caption{Figure 4}
\end{figure}
Figure 4 models a network of underground tunnels that have to be inspected. The number on each arc represents the length, in km, of each tunnel.
Joe must travel along each tunnel at least once and the length of his inspection route must be minimised.
The total weight of the network is 125 km .
The inspection route must start and finish at A .
- Use an appropriate algorithm to find the length of the shortest inspection route. You should make your method and working clear.
Given that it is now permitted to start and finish the inspection at two distinct vertices,
- state which two vertices should be chosen to minimise the length of the new route. Give a reason for your answer.