# Kruskal’s Minimum Spanning Tree Algorithm

The problem is to find the minimum weight spanning tree (i.e., a connected acyclic subgraph) of an undirected weighted graph. Kruskal’s algorithm finds the MST in time O(E log V). It is a greedy algorithm that always tries to add the next least-cost edge to the current set of edges in the MST if its addition does not create a cycle in the MST.

View original post 197 more words

Posted on June 3, 2013, in Algorithms and tagged Kruskal's Minimum Spanning Tree Algorithm. Bookmark the permalink. Leave a comment.

## Leave a comment

## Comments 0