1.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{0360f78d-e18c-4c47-a2ec-ddd705a4175f-2_750_1285_388_390}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
Figure 1 shows a network of roads between eight villages, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E } , \mathrm { F } , \mathrm { G }\) and H . The number on each arc gives the length, in miles, of the corresponding road.
- Use Dijkstra's algorithm to find the shortest distance from A to H .
(5) - State your shortest route.
(1) - Write down the shortest route from H to C and state its length.
(2)