3.
\begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 2}
\includegraphics[alt={},max width=\textwidth]{e64b50bc-13a3-4051-b8c1-d4e7ea49e3a5-4_622_1363_301_317}
\end{figure}
The network in Figure 2 shows the distances, in metres, between 10 wildlife observation points. The observation points are to be linked by footpaths, to form a network along the arcs indicated, using the least possible total length.
- Find a minimum spanning tree for the network in Figure 2, showing clearly the order in which you selected the arcs for your tree, using
- Kruskal's algorithm,
- Prim's algorithm, starting from \(A\).
Given that footpaths are already in place along \(A B\) and \(F I\) and so should be included in the spanning tree,
- explain which algorithm you would choose to complete the tree, and how it should be adapted. (You do not need to find the tree.)
(2)