KRUSKAL'S ALGORITHM

Input: G=(V,E,W), a connected graph

Output: , a MST of G

While do

Let be the least cost edge in E

if does not create a cycle in T

then add to T

end while

• Kruskal's Algorithm (Refined)
• Proof Of Correctness
• Weighted Union
• Compressed Find