5.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{049de386-42a9-4f16-8be3-9324382e4988-06_899_1241_230_411}
\captionsetup{labelformat=empty}
\caption{Figure 4
[0pt]
[The total weight of the network is 88]}
\end{figure}
- Explain what is meant by the term 'path'.
(2)
Figure 4 represents a network of roads. The number on each arc represents the length, in km, of the corresponding road. Tomek wishes to travel from A to J. - Use Dijkstra's algorithm to find the shortest path from A to J. State your path and its length.
(6)
On a particular day, Tomek needs to travel from G to J via A. - Find the shortest route from G to J via A , and find its length.
(3)
The road HJ becomes damaged and cannot be used. Tomek needs to travel along all the remaining roads to check that there is no damage to any of them. The inspection route he uses must start and finish at B . - Use an appropriate algorithm to find the length of a shortest inspection route. State the arcs that should be repeated. You should make your method and working clear.
(5) - Write down a possible shortest inspection route.
(1)