3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{0360f78d-e18c-4c47-a2ec-ddd705a4175f-4_986_1255_269_402}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
- Use Kruskal's algorithm to find a minimum spanning tree for the network shown in Figure 2. 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.
(3) - Starting at A, use Prim's algorithm to find a minimum spanning tree for the network in Figure 2. You must clearly state the order in which you include the arcs in your tree.
(3) - Draw a minimum spanning tree for the network in Figure 2 using the vertices given in Diagram 1 of the answer book. State the weight of the minimum spanning tree.
(2)
A new spanning tree is required which includes the arcs DI and HG, and which has the lowest possible total weight. - Explain which algorithm you would choose to complete the tree, and how the algorithm should be adapted. (You do not need to find the tree.)