Kruskal's Algorithm is a famous greedy algorithm used to find minimum cost spanning tree of a graph. Kruskal's Algorithm Example. Kruskal's Algorithm Time Complexity is O(ElogV) or O(ElogE).
