3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{17bc9fb2-13bf-4ffa-93ac-bef170467570-4_579_1273_239_397}
\captionsetup{labelformat=empty}
\caption{Figure 3}
\end{figure}
[The total weight of the network is 167]
Figure 3 represents a network of paths. The number on each arc gives the time, in minutes, to travel along that path.
- Use Dijkstra's algorithm to find the quickest route from A to H. State your quickest route and the time taken.
(5)
Kevin must walk along each path at least once and return to his starting point. - Use an appropriate algorithm to find the time of Kevin's quickest possible route, starting and finishing at A. You should make your method and working clear.