5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{1493d74b-e9ef-4c9a-91f6-877c1eaa74e2-06_712_1520_246_267}
\captionsetup{labelformat=empty}
\caption{Figure 4
[0pt]
[The total weight of the network is 181 miles]}
\end{figure}
Figure 4 represents a network of power cables that have to be inspected. The number on each arc represents the length, in km , of that cable.
A route of minimum length that traverses each cable at least once and starts and finishes at A needs to be found.
- 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.
It is now decided to start and finish the inspection route at two distinct vertices. The route must still traverse each cable at least once.
- Determine possible starting and finishing points so that the length of the route is minimised. You must give reasons for your answer.