4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{be646775-535e-4105-86b4-ffc7eda4fa51-4_653_1257_248_404}
\captionsetup{labelformat=empty}
\caption{Figure 4}
\end{figure}
- State two differences between Kruskal's algorithm and Prim's algorithm for finding a minimum spanning tree.
(2) - Listing the arcs in the order that you consider them, find a minimum spanning tree for the network in Figure 4, using
- Prim's algorithm,
- Kruskal's algorithm.
(6)