Spanning Tree | MST | Graph Theory

This video explains what is a spanning tree and minimum spanning tree or minimum cost spanning tree along with all it's important properties with examples which you will need to solve MST problems and also become confident for your interviews.I have explained when is a spanning tree possible for a graph and what can be the maximum number of spanning trees and how to find spanning trees and other such questions.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 :)

========================================================================

=======================================================================

[amitkumargupta]

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....

[reshmah]

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

[iamakifislam]

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

[kunalsoni]

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

[Learner]

complete package ... maza aa gaya. thank you

[spetsnaz_]

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

[ChandraShekhar-bycd]

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

[mayankchauhan]

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

[ashwinram]

Waiting for implementation of MST. Nice explanation

[nagarjunreddygaddam]

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

[vamshidharsingh]

Thanks a lot for the very crystal clear explanation!

[anmolwadali]

really simple & clear explanation !!! keep posting more

[theghostwhowalk]

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

[bigBel]

Thank you sir I'm a new subscriber

[AnkushKumar-mkns]

Awesome video with light Speed Outro.😍

[youniverse]

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

[amartyadutta]

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 ?

[rajeshbammidy]

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

[ayushgarg]

Does MST algorithms are true for negative weight edges ?

[gogyoo]

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