kruscal(G, w):
	A <- null
	for v θη V[G]:
		create_set(v)
	sort(E)
	for (u, v) θη E:
		if find_set(u) != find_set(v):
			A <- A + {(u,v)}
			
	return A