3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{6ccce35f-4e62-4b6b-acf6-f9b3e18d4b52-05_862_1460_219_299}
\captionsetup{labelformat=empty}
\caption{Figure 4}
\end{figure}
Figure 4 represents a network with nodes, A, B, C, D, E, F, G, H and J.
The number on each edge gives the length of the corresponding edge.
- Use Dijkstra's algorithm to find the shortest path from A to J.
- State the length of the shortest path from A to J .
One application of Dijkstra's algorithm has order \(n ^ { 2 }\), where \(n\) is the number of nodes in the network.
It takes a computer 0.0312 seconds to find the shortest path from a given start node to a given end node in a network of 9 nodes.
- Calculate approximately how long it would take, in minutes, for the computer to find the shortest path from a given start node to a given end node for a network of 9000 nodes.