Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.

1. SUBMITTED BY:-ROHIT MALAV

2.  Pick the cheapest link (edge) available and mark it
 Pick the next cheapest link available and mark it again
 Continue picking and marking link that does not
create the circuit
Kruskal’s algorithm is efficient and optimal

3. 5
7
8
3
6
4
2
10

4. 5
7
8
3
6
4
2
10
MST: 2+3+4+5+10=24
10

7. B D
H
P
W