Hi guys!

This blog talks about Prim’s algorithm. If you want a quick crash course on this topic stick around.

Prim’s Algorithm is a greedy algorithm which is used to find the minimum spanning tree of a graph.

History

This algorithm was developed by mathematician Vojtech Jarnik in 1930. He was a Czech mathematician .It was later rediscovered and republished in 1957 by Robert C. Prim, a Computer scientist. This is why the algorithm is also called Jarnik’s algorithm.

What is a Minimum spanning tree?

A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together…

Nandan Dave

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store