Kruskal Algorithm

Use Greedy algorithm to find the minimum spanning tree.

Running time analysis

For a graph $G=(V,E)$ , it depends on the specific implementation of the disjoint-set data structure.
$O(E\lg V)$

• Prim’s Algorithm