CSE { computer science & engineering } Video Lectures.
In this Lecture you will be learning about the Prim's Algorithm.
In computer science, Prim's (also known as Jarník's) algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
For more info / doubt write us at our mail or comment below.
PLEASE LIKE , SHARE & SUBSCRIBE
