2 Answer this question on the insert provided.
Fig. 2 shows a network in which the weights on the arcs represent distances.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{9716cf3f-afa5-44a4-a8cd-f7511449d06b-2_405_497_1046_776}
\captionsetup{labelformat=empty}
\caption{Fig. 2}
\end{figure}
- Apply Floyd's algorithm on the insert provided to find the complete network of shortest distances.
- Show how to use your final matrices to find the shortest route from vertex \(\mathbf { 1 }\) to vertex 3, together with the length of that route.
- Use the nearest neighbour algorithm, starting at vertex 1, to find a Hamilton cycle in the complete network of shortest distances.
Give the corresponding cycle in the original network, together with its length.