5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5b32eb57-c9cd-46ec-a328-12050148bdf7-6_829_1547_257_259}
\captionsetup{labelformat=empty}
\caption{Figure 4}
\end{figure}
\section*{[The total weight of the network is 344 miles]}
Figure 4 represents a railway network. The number on each arc represents the length, in miles, of that section of the railway.
Sophie needs to travel along each section to check that it is in good condition.
She must travel along each arc of the network at least once, and wants to find a route of minimum length. She will start and finish at A.
- Use the route inspection algorithm to find the arcs that will need to be traversed twice. You must make your method and working clear.
- Write down a possible shortest inspection route, giving its length.
Sophie now decides to start the inspection route at E. The route must still traverse each arc 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 your route.