2.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{b6d09c46-abfd-4baa-80bd-7485d1bf8e0d-03_759_1401_196_331}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
- Define the terms
- tree,
- minimum spanning tree.
- Use Kruskal's algorithm to find the minimum spanning tree for the network shown in Figure 1. You must clearly show the order in which you consider the edges. For each edge, state whether or not you are including it in the minimum spanning tree.
- Draw the minimum spanning tree using the vertices given in Diagram 1 in the answer book and state the weight of the minimum spanning tree.