ABSTRACT
The greedy strategy is used to find an MST. That is, at each step, the added edge can’t form a circuit, and based on it, the weight of the added edge should be minimal. Such an added edge is called a safe edge. There are two algorithms of MSTs:
1. Kruskal algorithm 2. Prim algorithm
The two algorithms get an MST by different methods.
