Spanning Tree | MST | Graph Theory

[@amitkumargupta6722]

It has been a long time that I am here at your channel...
Now I can say with full of confidence that teacher does't matters is just a myth...
Respect for you from the bottom of heart....

[@techdose4u]

Thanks

[@reshmah1497]

This video is Minimum Time Spanning video for understanding Spanning tree & MST. Best teaching Sir.

[@techdose4u]

Thanks :)

[@iamakifislam]

Again, founding your channel made me more interested in algorithms and competitive programming. Thank you. Your explanation is mind-blowing.

[@techdose4u]

Thanks :)

[@kunalsoni7681]

Helpful video 😊
Thank you sir so much
This Graph series is bestest on whole UA-cam..

[@Learner010]

complete package ... maza aa gaya. thank you

[@techdose4u]

Welcome

[@spetsnaz_2]

I am loving the topic i feared the most... Awesome explanation 🙏🏼

[@mayankchauhan6680]

Bhai you are the best. You explain everything in such a minimum amount of time. : )

[@techdose4u]

Thanks

[@ChandraShekhar-by3cd]

Thanks a lot for the crystal clear explanation!..Excited for the next on this series.

[@techdose4u]

Welcome :)

[@raakash99]

Thanks

[@bigBel]

Keep going , highly useful

[@anmolwadali9227]

really simple & clear explanation !!! keep posting more

[@techdose4u]

Thanks

[@DavidParathyras]

Excellent my friend!

[@vamshidharsingh5549]

Thanks a lot for the very crystal clear explanation!

[@techdose4u]

Welcome :)

[@theghostwhowalk]

Thanks for video. Looking forward to Prims and Kruskal and then also to learn why Dijkstra can’t be applied to find MST.

[@techdose4u]

stackoverflow.com/questions/1909281/use-dijkstras-to-find-a-minimum-spanning-tree

[@theghostwhowalk]

@@techdose4u Thanks! I see why it can not be used. MST path is not always guaranteed with Dijkstra.

[@AnkushKumar-mk8ns]

Awesome video with light Speed Outro.😍

[@techdose4u]

Thanks

[@nagarjunreddygaddam5059]

Thank you for all the work you are doing. Can't wait for prims and kruskal videos.

[@ashwinram9081]

Waiting for implementation of MST. Nice explanation

[@techdose4u]

Thanks

[@amartyadutta2477]

Very well explained Thanks . Sir can you help me how to solve maths problem in competitive programming (to ace a job) and what number theory concept we should study ?

[@bigBel]

Thank you sir I'm a new subscriber

[@gogyoo]

Thanks a ton Surya for this. 10:00 Shouldn't (A,B) -> 12 and (B,D) -> 7 though?

[@pablobear4241]

Thats what I notice as well

[@TheCuriousLifeOfCode]

@7:27 - Minimum Spanning Tree

[@zinabudesta7333]

Thank You

[@rajeshbammidy180]

You missed one thing, ie.. Number of Spanning Trees that can be generated from a given tree NumberOfSpanningTree= (EC|V-1| - number of cycles) where C represents Combinations like nCr

[@avinashprasad4181]

Is C= no. Of cycles?

[@rajeshbammidy180]

@@avinashprasad4181 I have updated it,please check

[@ayushgarg5929]

What is EC can you clear it ?

[@carolinaalbamaruganrubio2446]

Thank you!!

[@techdose4u]

Welcome 😀

[@ayushgarg5929]

Does MST algorithms are true for negative weight edges ?

[@hardikanand6153]

What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?

[@shashankagrawal2378]

How will it impact if I tweak the question, say if the same path has been taken twice (assuming undirected graph) the cost of travel is zero. Kindly Include this also in your implementation.

[@youniverse69]

Sir, In application (A,B) = 20 and (B,D) , I can't understand that, could you please tell me ?!

[@techdose4u]

I dint get your question. Please mention timestamp as well.

[@lasyapriya4076]

@@techdose4u 10:20

[@jalajgupta4564]

mast.❤️🔥

[@techdose4u]

Thanks

[@ajays5253]

Which software you are using sir?

[@techdose4u]

Wacom pro inkspace

[@casinarro]

can i get notes

[@vend57]

First

[@techdose4u]

Nice :)