step 1: Sort_E= Sort the set E of edges by nondecreasing order.
step 2: For each vertex v in V do
Step 3: Make set(v)
Step 4: for each edge (u, v) in E in the nondecreasing order do
step 5: if (u and v are in different components) then
step 6: Union (u, v)