5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{6417303d-c42a-4da4-b0fa-fb7718959417-7_778_1369_239_354}
\captionsetup{labelformat=empty}
\caption{Figure 5}
\end{figure}
\section*{[The total weight of the network is 214]}
Figure 5 models a network of canals that have to be inspected. The number on each arc represents the length, in km , of the corresponding canal. Priya needs to travel along each canal at least once and wishes to minimise the length of her inspection route.
She must start and finish at A .
- Use the route inspection algorithm to find the length of her route. State the arcs that will need to be traversed twice. You should make your method and working clear.
(6) - State the number of times that vertex F would appear in Priya's route.
(1)
It is now decided to start the inspection route at H . The route must still travel along each canal at least once but may finish at any vertex. - Determine the finishing point so that the length of the route is minimised. You must give reasons for your answer and state the length of the minimum route.
(3)