Implementation
C
[
v
] is the color of nodes in
v
's group.
L
[
c
] is a linked list of nodes for color
c
.
Next:
Running Time: Bound One
Up:
KRUSKAL'S ALGORITHM
Previous:
Better Implementation
![\begin{algorithm}
{Join}{C,L,u,v}
\begin{IF}
{\mbox{size}(L[C[u]]) < \mbox{size...
...\= C[u] \ \mbox{append}(w,L[C[u]])
\end{FOR} \ \RETURN (C,L)\end{algorithm}](img17.gif)
