3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{4609ffb5-d270-4ff3-aa44-af8442a38b66-4_591_1581_239_258}
\captionsetup{labelformat=empty}
\caption{Figure 3}
\end{figure}
Figure 3 shows a network representing the time taken, in minutes, to travel by train between nine towns, A, B, C, D, E, F, G, H and T.
A train is to travel from A to T without stopping.
- Use Dijkstra's algorithm to find the quickest route from A to T and the time taken.
(6)
At present, the train travels from A to T via F without stopping. - Use your answer to (a) to find the quickest route from A to T via F and the time taken.
(2)
A train is to travel from A to T , stopping for 2 minutes at each town it passes through on its route. - Explain how you would adapt the network so that you could use Dijkstra's algorithm to find the quickest route for this train. You do not need to find this route.
(2)