Kruskal's Algorithm Flashcards
0
Q
Step 2
A
Start with the shortest edge.
1
Q
Step 1
A
List all the edges in order of increasing length.
2
Q
Step 3
A
From all the remaining edges select the shortest edge which does not form a cycle.
3
Q
Step 4
A
Repeat step 3 until Ll the vertices are connected.
