pseudo-code Algoritma Kruskal

int kruskal(int n, int m, set_of_edges E,

set_of_edges& F)

{

set_pointer p, q;

edge e;

sort the m edges in E by weight;

initial(n);

while (# of edges in F < n1)

{

e = next lowest weight edge;

i,j = e.indices();

p = find(i);

q = find(j);

if (! equal(p,q)) {

merge(p,q);

add e to F;

}

}

}