Prim algorithm
It was Robert C. Prim in 1957 who gave his surname to Prim's algorithm, which takes an undirected connected graph and calculates its MST in linear time.
Other algorithms, such as Kruskal and Borûvka, also calculate the MST of a graph, but in these cases the initial graph is a forest, not an undirected connected graph, which is what we are going to try out now.
Let's see how Prim's algorithm works with a real example. Here's a graph G with the following vertices, edges, and weights:
Initial undirected connected graph
Here are the steps to calculate the MST:
- Start with an arbitrary vertex of the graph. For clarity, we are going to start ...
Get Swift Data Structure and Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
