3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{9edb5209-4244-4916-b3ee-d77e395e8cab-04_977_1472_259_294}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
Figure 2 represents a network of train tracks. The number on each edge represents the length, in kilometres, of the corresponding track.
Dyfan wishes to travel from A to J via C. Dyfan wishes to minimise the distance they travel.
Given that Dijkstra's algorithm is to be applied only once to find Dyfan's route,
- explain why the algorithm should begin at C.
- Use Dijkstra's algorithm to find the shortest route from A to J via C. State this route and its length.
- Use Prim's algorithm, starting at C , to find a minimum spanning tree for the network. You must clearly state the order in which you select the edges of your tree.
- State the total length, in km , of the minimum spanning tree.