2.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{50925a06-9a9b-4e50-869a-2dce6680615c-03_741_1200_212_434}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
Figure 1 represents the distances, in metres, between eight vertices, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E } , \mathrm { F } , \mathrm { G }\) and H , in a network.
- Use Kruskal's algorithm to find a minimum spanning tree for the network.
You should list the arcs in the order in which you consider them. In each case, state whether you are adding the arc to your minimum spanning tree.
- Complete Matrix 1 in your answer book, to represent the network.
- Starting at A, use Prim's algorithm to determine a minimum spanning tree. You must clearly state the order in which you considered the vertices and the order in which you included the arcs.
- State the weight of the minimum spanning tree.