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:
/ @techdose4u
INSTAGRAM : / surya.pratap.k
SUPPORT OUR WORK: / techdose
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithT...
TELEGRAM Group LINK: t.me/joinchat/...
=======================================================================
USEFUL Videos:-
Spanning Tree: • Spanning Tree | MST | ...
Prims algorithm: • Prims algorithm | MST ...
Disjoint SET: • Disjoint Set | UNION a...
Disjoint set UNION by RANK and Path Compression: • Disjoint set UNION by ...

[@bharathhp8946]

One of the best channel for DSA in youtube.

[@techdose4u]

Thanks :)

[@user-oy4kf5wr8l]

really amazing, i only look at ur videos for algo. Really fantastic job!

[@ayyappareddy4461]

Thank you sirr i passed algorithms exam because of your videos. I seen all well explained siirrr thankss

[@techdose4u]

Nice to hear this ❤️ welcome 😊

[@aryanpatidar5392]

your explanation is unbelievable, I have tried multiple channels but yours is the best..................................

[@utkarshsrivastava5458]

Sir your explanations are the best🙂
Waiting for Dijkstra's Algorithm

[@techdose4u]

Thanks

[@raghavendrakumarsingh4646]

Nice explanation

[@kunalsoni7681]

Wow 😊 this algorithm is really very easy to understand and sir you make this more and more easily to understand
Thank you so much sir 😊😇🙏💕

[@techdose4u]

Welcome :)

[@mokshmangal9308]

Sir your explanation is very good.

[@impatientgaming9868]

helpful!

[@ravikumar-nl7zt]

Your videos are great Sir 👌.
Please make video on Dijkstra algorithm

[@techdose4u]

It will come after Hamiltonian problem

[@MahirHasancse21]

Thank you very much😊

[@techdose4u]

Welcome :)

[@naman_goyal]

Awesome video..thanku sir

[@techdose4u]

Welcome

[@pleasesirmorevideos4684]

Thanks a lot sir

[@techdose4u]

Welcome

[@spetsnaz_2]

LMAO ur name🤣

[@aniketmasram6500]

Thankyou soo much bhaiyaa 🔥🔥

[@techdose4u]

Welcome :)

[@tanmay6670]

Does kruskal or Prims algo finds the minimum distance between 2 nodes ? Is there chance that MST may be smallest distance ?

[@techdose4u]

It is not guaranteed. You have shortest distance algo for that.

[@pleasesirmorevideos4684]

How stupid

[@prabhatchanchal]

Thank you sirG

[@techdose4u]

Welcome

[@chelidoniii]

8k views without a dislike
this is gold

[@techdose4u]

:)

[@maheshm4292]

Sir can you share how you make your videos, the process, the softwares/apps, how you record,?? Cuz I too want to teach just like you. Well not DSA but it's UI dev

[@myaseen7419]

Sir i need your help please give me one or two minutes i have made a video on camtasia which you tell us but i can't play this video on my pc,please help sir

[@SahilThakur26]

Wouldn't DSUF's logv is amortised constant because of ackerman's function ?

[@crimsoncad3230]

Don't know why, but saying ASCENDING order as NON DECREASING order makes things really confusing.

[@techdose4u]

They both are slightly different. In this case, it's non-decreasing which means multiple values can be same.

[@ashwanikumar4288]

Great explanation sir!! I have a question. What is the base in LogV for DSUF algo?

[@ardalaaruna6315]

Sir, Application of Krushkal and prime algorithms??

[@vishalwaghmare3130]

Sir! What is DSUF ?

[@techdose4u]

Disjoint set union find.

[@mayankjain876]

Sir code is not necessary for this?
Because concept I got

[@techdose4u]

Still I will upload a video with example and code for everyone else 😅

[@mayankjain876]

@@techdose4u Actually I have also studied graph previously but to code for union find and disjoint set for cycle detection I scared little bit

[@mayankjain876]

@@techdose4u is it necessary to find cycle with union find algo in kruskals

[@mayankjain876]

@@techdose4u can't we use dfs bfs for cycle detection in kruskals? If yes then how

[@spetsnaz_2]

@@mayankjain876 we can use DFS/BFS but time complexity will be E^2

[@ahmadbodayr7203]

if you are not muslim read about islam friend❤