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.
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.
A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together…