5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{63f3ba38-8bca-4684-957f-aca7104f2f3e-05_863_1061_223_360}
\captionsetup{labelformat=empty}
\caption{Fig. 2}
\end{figure}
The network in Figure 2 represents the streets near Randolph Square in Newtown, Edinburgh. The weightings represent the average time, in seconds, taken to travel along each road in either direction. The large values for the roads \(C D\) and \(J L\) are due to traffic lights.
In the course of his work, a van driver must travel along each road at least once each day. He starts and finishes at his depot, \(F\), and wishes to minimise the total time that this takes.
- Describe an appropriate algorithm that can be used to find this minimum time.
(3 marks) - Apply this algorithm to find a route that the driver can take and state the total time he can expect to spend on this journey each day.
(5 marks)
The section of road \(A B\) is to be turned into a pedestrian precinct. - Assuming that the driver must still travel along all the other roads at least once each day, find the modified time he can expect to spend on his daily journey
Comment on your answer.
(3 marks)
Turn over