7 [Figure 2, printed on the insert, is provided for use in this question.]
The network shows the times, in seconds, taken by Craig to walk along walkways connecting ten hotels in Las Vegas.
\includegraphics[max width=\textwidth, alt={}, center]{e47eb41e-0a4b-4865-a8ff-6c9978495ee0-07_1435_1267_525_351}
The total of all the times in the diagram is 2280 seconds.
- Craig is staying at the Circus ( \(C\) ) and has to visit the Oriental ( \(O\) ).
Use Dijkstra's algorithm on Figure 2 to find the minimum time to walk from \(C\) to \(O\).
- Write down the corresponding route.
- Find, by inspection, the shortest time to walk from \(A\) to \(M\).
- Craig intends to walk along all the walkways. Find the minimum time for Craig to walk along every walkway and return to his starting point.