The document outlines the steps of Kruskal's algorithm, which focuses on selecting the cheapest edges without forming circuits to build a minimum spanning tree (MST). It provides an example calculation for the MST, resulting in a total cost of 24. The document also mentions a sequence of numbers and letters, likely representing graph nodes or edges.

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