7.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{552f3296-ad61-448b-8168-6709fb359fa2-7_915_1509_267_278}
\captionsetup{labelformat=empty}
\caption{Figure 5}
\end{figure}
Figure 5 shows the possible bus journeys linking towns, S, A, B, C, D, E, F, G, H and T. Each arc represents a bus journey. The number on each arc represents the cost, in pounds, of travelling along that route.
- Use Dijkstra's algorithm, on the diagram in the answer book to find the cheapest route from S to T. State your cheapest route and its cost.
(6) - Explain how you determined your cheapest route from your labelled diagram.
The bus journey from S to B is cancelled due to a driver's illness.
- Find the cheapest route from S to T that does not include SB , and state its cost.