Prims algorithm | MST | Code implementation

In this video,I have explained the prim's algorithm which is used to find the minimum spanning tree.I have first explained the intuition for Prims algorithm and then i have shown a simple example.After that, I have shown a proper CODE algorithm using large example and at the end of the video,I have explained the CODE implementation of prims algorithm.I have explained this algorithm in an easy and simple way to follow.This is a greedy algorithm for finding minimum cost spanning tree.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :) ======================================================================== Join this channel to get access to perks:    / @techdose4u   INSTAGRAM :   / surya.pratap.k   SUPPORT OUR WORK:   / techdose   LinkedIn:   / surya-pratap-kahar-47bb01168   WEBSITE: https://techdose.co.in/ TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5... ======================================================================= CODE LINK: https://gist.github.com/SuryaPratapK/... USEFUL VIDEOS:- Disjoint Set (Simple):    • Disjoint Set | UNION and FIND   Disjoint set UNION by RANK and Path Compression:    • Disjoint set UNION by RANK and Path Compre...