Kruskal's Algorithm

Question 0

Step 2

Answer 0

Start with the shortest edge.

Question 1

Step 1

Answer 1

List all the edges in order of increasing length.

Question 2

Step 3

Answer 2

From all the remaining edges select the shortest edge which does not form a cycle.

Question 3

Step 4

Answer 3

Repeat step 3 until Ll the vertices are connected.