# Prim’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. Earlier, I described the Kruskal’s algorithm to find the MST in time O(E log V). Prim’s algorithm is another greedy algorithm that finds an MST in time O(E log V). The difference is that the Prim’s algorithm grows an MST, starting from a single vertex, always adding the least-cost edge from a tree vertex to a non-tree vertex to the current set of edges in the MST.

View original post 159 more words

Advertisements

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

## Leave a comment

## Comments 0