DAA66: Minimum Spanning Tree Algorithm | Sapnning Tree | Properties of Spanning Tree

[@shubhamtyagi60]

One of the best teacher for CSE students at TH-cam ❤

[@complexyt6245]

+1

[@sandeepsharma-ov8os]

Sir good padhate h aap

[@ThePaglaiteers]

In property 3 you said that the no. Of v and e are equal which over ruled the property 1

[@UniversityAcademy]

You not understanding properly I am talking about same edge and vertex in all generated spanning-tree mean if we ganerating 3 spanning-tree for any graph then the count of vertex and edges are same in all ..... hope you got it

[@tarunparmar1723]

Thanku sir

[@pratik2617]

god level explanation

[@DeepakSingh-wj2ps]

Optimal solution is a 55.33 is right or not

[@durgeshagrhari]

right bro

[@krishnaradhey2814]

Gate admit card are out

[@farmygaming9609]

max profit = 55.33

[@47xxGAMING]

Why you saying Spanning Tree as Eespanning Tree

[@pratik2617]

he is from up bihar paji , accent ka kamal hai

[@naveenbaghel_11]

u r watching it online thats why it is e-spanning tree

[@udaysingh2929]

@@naveenbaghel_11😂🤣

[@zaidmekrani8983]

❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤