3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{552f3296-ad61-448b-8168-6709fb359fa2-3_780_1353_248_356}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
Figure 1 represents the distance, in metres, between eight data collection points, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E } , \mathrm { F }\), G and H . The data collection points are to be linked by cables.
- Listing the arcs in the order that you select them, find a minimum spanning tree for the network using
- Kruskal's algorithm, stating in addition any arcs you reject,
- Prim's algorithm, starting from A .
- State the minimum amount of cable needed.
- Draw your minimum spanning tree using the vertices given in Figure 1 in your answer book.