5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{e0c89aba-9d2e-469b-8635-d513df0b65a4-06_725_1718_242_169}
\captionsetup{labelformat=empty}
\caption{Figure 6
[0pt]
[The total weight of the network is 601]}
\end{figure}
Figure 6 represents a network of footpaths in a park. The number on each arc is the length, in metres, of the corresponding footpath. An inspection route of minimum length that traverses each footpath at least once needs to be found.
- Write down the nodes at which the route will start and finish.
(1)
It is now decided to start the inspection route at B and finish the inspection route at D . A route of minimum length that traverses each footpath at least once needs to be found. - By considering the pairings of all relevant nodes 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.