4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{e02c4a9a-d2ab-489f-b838-9b4d902c4457-5_679_1420_228_312}
\captionsetup{labelformat=empty}
\caption{Figure 5}
\end{figure}
Figure 5 models a network of roads. The number on each edge gives the time, in minutes, taken to travel along that road. Olivia wishes to travel from A to J as quickly as possible.
- Use Dijkstra's algorithm to find the shortest time needed to travel from A to J. State the shortest route.
On a particular day Olivia must include G in her route.
- Find a route of minimal time from A to J that includes G , and state its length