Algorithm

There's an algorithm for doing this.


\begin{algorithm} {Kruskal-MST}{G,w} T \= \emptyset \ S \= \mbox{\sc Sort}(G[... ... u,v) \ T \= T \cup \{(u,v)\} \end{IF} \end{FOR} \ \RETURN T\end{algorithm}

next up previous
Next: Correctness Up: KRUSKAL'S ALGORITHM Previous: Recap