1.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{3e853c6d-e90e-4a09-b990-1c2c146b54e1-2_1105_1459_463_402}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
Figure 1 represents a network of roads.
The number on each arc represents the time taken, in minutes, to drive along the corresponding road.
- Use Dijkstra's algorithm to find the shortest time needed to travel from A to H .
- State the quickest route.
For a network with \(n\) vertices, Dijkstra's algorithm has order \(n ^ { 2 }\)
- If it takes 1.5 seconds to run the algorithm when \(n = 250\), calculate approximately how long it will take, in seconds, to run the algorithm when \(n = 9500\). You should make your method and working clear.
- Explain why your answer to part (b) is only an approximation.