Kruskal's Algorithm

External

• https://www.coursera.org/learn/algorithms-greedy/lecture/PLdBf/kruskals-mst-algorithm

Internal

• The Minimum Spanning Tree Problem
• Greedy Algorithms
• Graph Concepts
• Union-Find

Overview

Kruskal's algorithms is a greedy algorithm that computes the minimum cost spanning tree for an undirected connected graph. It has a different approach than Prim's algorithm

Correctness Proof

https://www.coursera.org/learn/algorithms-greedy/lecture/U3ukN/correctness-of-kruskals-algorithm