5. This question should be answered on the sheet provided.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{6c6b7934-ab46-4a87-8a11-f99bf9a5d743-05_834_1436_306_280}
\captionsetup{labelformat=empty}
\caption{Fig. 3}
\end{figure}
Figure 3 shows a weighted network. The number on each arc indicates the weight of that arc.
- Use Dijkstra's algorithm to find a path of least weight from \(A\) to \(J\) and state the weight of the path.
Your solution must show clearly how you have applied the algorithm including:
- the order in which the vertices were labelled,
- how you determined the path of least weight.
- Find if there are any other paths of least weight and explain your answer.
- Describe a practical problem that could be modelled by the above network.