6.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{22ff916a-4ba8-4e0c-9c53-e82b0aff0b98-07_684_1420_233_312}
\captionsetup{labelformat=empty}
\caption{Figure 5}
\end{figure}
[The total weight of the network is 384]
Figure 5 models a network of corridors in an office complex that need to be inspected by a security guard. The number on each arc is the length, in metres, of the corresponding section of corridor.
Each corridor must be traversed at least once and the length of the inspection route must be minimised. The guard must start and finish at vertex A.
- Use the route inspection algorithm to find the length of the shortest inspection route. State the arcs that should be repeated. You should make your method and working clear.
(5)
It is now possible for the guard to start at one vertex and finish at a different vertex. An inspection route that traverses each corridor at least once is still required. - Explain why the inspection route should start at a vertex with odd degree.
(2)
The guard decides to start the inspection route at F and the length of the inspection route must still be minimised. - Determine where the guard should finish. You must give reasons for your answer.
- State a possible route and its length.