Kruskals algorithm | Construct MST смотреть онлайн

This video explains the kruskals algorithm to find the minimum cost spanning tree in an undirected weighted and connected graph.This is a greedy algorrithm just like the prims algorithm.However, this algorithm differs from prims algorithm because in kruskals algorithm we can select edges at random and so the MST can grow arbitrarily at any point but in prims algorithm, we pick a starting point and the MST grows in adjacent vertices only.I have explained the working of kruskals algorithm using proper example.We are given a graph and we form the edge list.Then we sort the edge list in non-descending order and then we start iterating for each edge one by one and process all edges.If on including an edge no cycle is formed in MST then we include that edge otherwise we discard it.We repeat the process unless (V-1) edges are included in order to form the MST.I have explained the time complexity of the algorithm at the end of the video.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:
https://www.youtube.com/channel/UCnxhETjJtTPs37hOZ7vQ88g/join

INSTAGRAM : https://www.instagram.com/surya.pratap.k/

SUPPORT OUR WORK: https://www.patreon.com/techdose

LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168

WEBSITE: https://techdose.co.in/

TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE

TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5eEGI4aQ
=======================================================================
USEFUL Videos:-
Spanning Tree: https://youtu.be/jMioOe2eTcY
Prims algorithm: https://youtu.be/xthRL0lcx2w
Disjoint SET: https://youtu.be/eTaWFhPXPz4
Disjoint set UNION by RANK and Path Compression: https://youtu.be/kaBX2s3pYO4