DAA67:Minimum Spanning Tree Kruskal Algorithm | Kruskal's Algorithm Step by Step Explanation

[@MULTIPLEXER_ENCODER]

Thank You Sir…..Aapne ek video mein sab samjha diya

[@_AnshiSaxena]

Thankyou so much sir,aap jo bhi samjhate hai acche se samjh aata hai,doston please sir ki videos ko jarur like kre, vo sach mae bohit mehent kr rahe hai😊

[@smrjt9102]

I thank u from the bottom of my heart sir for uploading all these recent topics related to Design and Analysis of Algorithm ( DAA ) lectures. As I was searching for all these topics the day before yesterday in your TH-cam channel but couldn't found one but today you've uploaded all these videos. Thank you Sir.

[@UniversityAcademy]

Great keep watching and plz support my channels by spreading link of my channel to all social media profile.

[@GauravSingh-tq5vm]

Thank you sir apne ek video m he smjha diya thanks a lot

[@suyash.01]

MST found at 18:50 is probably correct. The actual minimum spanning tree has a total weight of 29 and NOT 37.

[@Rajat_maurya]

kaise bhai

[@manikumar9281]

THANK YOU

[@rizone1920]

Sir you are better my daa teacher thank you sir

[@Vikashgautam953]

Thank you sor for daa teaching

[@manyavarshney4399]

best explanation🙌

[@brutalg3858]

Thankyou sir best explanation 🔥🔥

[@rajmaddheshiya4913]

(a,b) is missing in the set A. Probably ,sir forgot to add it in the set. So, 37 is correct

[@unknownartist9455]

Thankyou Sir

[@manishapanchal6997]

Vry nice sir

[@aruneshgautam9957]

edge bc and ah both have 8 value .
can I connect ah instead of bc ?
because it also gives right answer.
please clarify..

[@jimmynation5939]

First and foremost the formation of min spanning tree should be given priority if it happens then we can do so.

[@jimmynation5939]

and yes after going through the question ..it can be achieved.

[@vanshikarastogi9494]

i also joined ah ....

[@nancygupta4768]

sir isme number of vertices and edegs are different which is not the property of a spanning tree

[@kritikmalhotra1713]

Is it wrong then?

[@thesumitkumar0]

Spanning tree condition
no of edges =no. Of vertices -1

[@NeverGiveup-uj9zq]

I love you Nancy

[@MULTIPLEXER_ENCODER]

@@NeverGiveup-uj9zq😂😂😂😂

[@MULTIPLEXER_ENCODER]

I also love you nancy
😘😘❤️❤️

[@nadeemmehraj5873]

👍👍👍👍👍👍👍👍

[@varumgautam9711]

🔥🔥🔥🔥

[@trendingwithSK]

But iska programm kaha mileage 😢

[@shobhitmishra739]

🔥

[@NeverGiveup-uj9zq]

Hii pig Bhai

[@manishapanchal6997]

Ye dislike kon krta h 👹

[@i.ankitkumar]

Kuchh faltu log

[@backbenchers037]

Jinko samjhh me nhi aaya 😂😘

[@ambermittal8174]

Mam aap ab kha pe ho

[@manishapanchal6997]

@@ambermittal8174 apne ghr😂😂

[@kamalkiduniya]

😂😂 mai to like karta hu