Algorithm for spanning tree using krushkal?

It's an algorithm to find the spanning tree in decision maths. The method is:

1. list weights in ascending order from smallest weight to largest weight.
2. then starting form the beginning of your list, tick the weights you want to use and cross out the ones which make a cycle. do this till you've reached all the nods then cross out the rest.
3. add up the weights you used to give you the total weight of the spanning tree.