Prim’s Algorithm for Minimum Spanning Tree

In this video we will see Prims algorithm in data structure which is a greedy algorithm for finding 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. See Full Playlist on Data Structures: https://www.youtube.com/playlist?list=PLS1rTZkO2DjZiSUk_vc7UYfkC0jT1-CKi #Graph #PrimsAlgorithm #AnimatedStudy