4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{71a3bf06-0305-44fa-9038-d3c8b69522a6-5_919_1470_221_301}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
\section*{[The total weight of the network is 196]}
Figure 1 models a network of roads. The number on each edge gives the time, in minutes, taken to travel along that road. Oliver wishes to travel by road from A to K as quickly as possible.
- Use Dijkstra's algorithm to find the shortest time needed to travel from A to K . State the quickest route.
On a particular day Oliver must travel from B to K via A .
- Find a route of minimal time from B to K that includes A , and state its length.
Oliver needs to travel along each road to check that it is in good repair. He wishes to minimise the total time required to traverse the network.
- Use the route inspection algorithm to find the shortest time needed. You must state all combinations of edges that Oliver could repeat, making your method and working clear.