Spanning Tree - Minimum Spanning Tree | Graph Theory #12

Spanning tree - Minimum spanning tree is the spanning subgraph with minimum total weight of the edges.

[@anoriginalnick]

Perfect lecture speed. Thank you for making it to explicit !

[@nelsonraley]

Very excellent tutorial, thank you so much! Always nice to have someone who speaks clearly and uses a real whiteboard instead of pen and paper or slides.

[@durreenwilliams1040]

Thanks much, you are very clear and a great teacher. I love how u constantly reiterate the common errors, that is watch out for the cycle

[@Ben-sk7ey]

Your videos are helping me understand these concepts. You explain well. Thank you.

[@neniscarlet3880]

I have been cramming for exams! And your video really has given me a good understanding of the topic! Thank you so much!

[@SandipDas-bd2pt]

Thank you for spaning tree . It's helpful.

[@stellasotirianou]

You really helped me study for my exams. Keep up the good work!! Could you add to your content topics from "algorithms and complexity" ?

[@divya_agin]

Thank you, sir. This video helps me to understand the basics of this topic 'Minimal Spanning Tree'

[@gayathrigirishnair7405]

Thank you for a clear and concise explanation. Please do make videos on other topics related to computer science.

[@user-fy8ee5zt3b]

Clear and very well explained.

[@anujashaju5425]

Well Presented..... Really appreciable

[@nkirukaodu3349]

Well done, You really helped

[@BRANDOJHAKSAELARMAS]

a lot of love from Italy. Thank youuuuuuuuuuu

[@calebkrauter4027]

SO helpful. Thank you.

[@techbeauti]

Great Explanation!

[@mayank19saxena]

Very well explained!

[@iramabbas9455]

Yr videos are amazing, it's too helpful for all of us,Keep it up. 👍👌👌

[@tsankhulojamson5970]

You are talented sir. We have understood the whole concept of the spanning graphs within few minutes. Thank you for this. May you do the same for algebraic graph theory please sir

[@rahulsrinivasan7919]

thank you so much! easily understandable

[@khaledalharbi911]

Great Explaination , Thank You

[@Hmmwyd]

Great video thank you!

[@suhailchandio]

A fabulous way to teach

[@sawjankumarshanu4394]

Mind-blowing class brother.

[@mariatheresalouis8540]

super helpful! thank you so much!!

[@matalavedika9375]

The way u explained is super Thank U sir.

[@afzabashir7958]

Excellent.l prepare my exam topics from your channel. Its help me a lot.

[@MrAbsinator]

God bless your work thanks man

[@mifkamorphosis]

your explanation is so easy to understand sir. thank you very much

[@Anilkumar-Ch17]

made it clear brother..thanks

[@sinenhlanhlamthiyane574]

You made me enjoy mathematics and you make it easy for me to study for exam

[@chndrikaakkiraju9033]

Good explanation and gud voice clarity tq

[@Paramjeet54839]

Really helpful thanks for this

[@nachogallego1075]

thx bro you save me for my exam tomorrow :)

[@ViduraDhananjaya]

Awesome job man. You just saved my ass in exam. #hatsoff

[@DonLarryTT]

Thank you for the video. It was very helpful :) ... PD: in min 12:00, the best edge is e-d with a weight of 3

[@user-ye7kn6kd3d]

e-d have weight 8 not 3

[@msdianpatel3214]

What is wait how we know the wait off the edge

[@msdianpatel3214]

What is wait how we know the wait off the edge

[@msdianpatel3214]

@@user-ye7kn6kd3d what is wait how to know wait

[@rajkrishna1933]

Excellent explanation

[@kunalkashyap5487]

Great job keep it up brother ur video is really helped mee soo thanks alott

[@subashini288]

thank u sir your videos are very useful for studies

[@chinnadurai8473]

Thank you sir for clear explanation

[@olanature1]

Hello, very informative video. please can you explain the Radio mean number of a graph?

[@shaymapathan1383]

You have a very nice smile :) Thanks for this tutorial.

[@Incredible2India]

😂

[@Incredible2India]

पढाई pr dhyan do beta 🤣🤣

[@abhigyanraha5620]

very good explanation

[@bhavyaanbarasan7919]

Excellent can you please do a video an decomposition of graph

[@janakisowmya91]

Very clear explanation sir

[@hemanthyadav2177]

Excellent👍💯 sir easily to understand thank u helpful to me

[@nilufarbagherzadeh8157]

perfect perfeccccctttt thank you so much

[@bkhomseehomsee9091]

very excellent ! you can be like boss.

[@idreesfatima38]

great keep it up...make more vedios on graph theory..

[@piyushkhanna7430]

superb sir

[@ahmetkarakartal9563]

thank you so much

[@manjirasaraekanayakaalphys9256]

Thank u very much.I'm from Sri Lanka.good luck❤

[@mitalkhapandi8617]

Superb explaination 👌⭐

[@Understanding_the_world_withme]

Thank you very much sir.

[@engineerfred9427]

Thank you very much🥰🥰

[@user-il2lt6il9o]

omg this explanation is so much better than what I was taught in uni. university is a joke lol

[@kovan111]

wooow bro. you are a very good teacher you thank you

[@tr3251qw]

thanks a lot !

[@hardikanand6153]

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

[@sanketnaik738]

Thank you sir ❤️

[@thereselauritano361]

so helpful

[@annesarahsadien3620]

thanks!!

[@ruth5746]

how to find the weights for edges?

[@shwetabandgar6862]

So nice explain

[@quocbaonguyen4450]

thank you

[@swatibagul3161]

Sir l watched your videos which was very good. Can you make video on Group and rings of discrete mathematics.

[@getachewmuhabaw7755]

you are nice bro...................really you can explain the the whole concept thank you..................my lovely lecturer i get in my life nice!!!!!!!!!!!!!!!!!!!! please make lecture 1 .Data structure and algorithms 2. computer organization 3.computer graphics and java programming language

[@anamikaroy1120]

Thank you sir

[@aparnamurugaiyan8139]

Thanks sir 👍

[@aishwaryaningam5144]

Hello sir ,can u say about breath first search and depth first search in spanning tree

[@JavaAidTutorials]

Nice one brother. Good explanation...(Y)..#JAVAAID

[@husnainumar2099]

thanks brother

[@hargunsandhu8833]

Best teacher

[@beefymcwhatnow6233]

thanks bro

[@arpangupta2162]

it was A GOOD VIDEO

[@sachinmaurya3259]

nice video

[@roopabeethoju9498]

How to take that minimum weight number

[@nirajmohanty5769]

Sir ed edge have weight is 3 so it should be counted replacing fd edge having weight 4

[@user-ye7kn6kd3d]

ed have 8 weight not 3 .

[@pavankarantotu5335]

Very nice sir 👌👍👌👍👌

[@betelhemnegrew7068]

thank you so muche

[@mayuripatel2842]

Sir e to d is possible without cycle its value is 3 so why you didn't take that???

[@drishtijain2161]

Value is 8.

[@anime_thrones_endgame]

Super bro... 😘😘😘😘😘😘😘😘😘😘😘😘😘😘😘😘😘

[@rajkumarsuryavanshi8136]

Bhava gaav kont re tuzz...??

[@shaikmufez2838]

Nice

[@sakshigoyal6143]

Maximum number of spanning trees connected graph with n nodes are...?

[@AK-fn7ro]

N^N-2

[@betavenomlite6379]

Tq sir ❤️

[@azrakhan4403]

Sir i have a problem in graph theory...i need your help

[@gsharthika592]

Thanku sir

[@stepsfromhell6629]

e to d=3 possibility without cycle in minimum spanning tree in 2nd example

[@DonLarryTT]

That's exactly what I was going to do xD (comment about that possibility)

[@drishtijain2161]

e to d costs 8 and not 3. Look again closely.

[@DonLarryTT]

@@drishtijain2161 mmm you're right :o

[@amitmauryathecoolcoder267]

Thank you , bhaiya.

[@chamarthykoushik204]

Nice class sir ☺️😊👍

[@sahilprasantachoudhury911]

Self referential note: ae video pare Prim's algo au Kruskal's algo video dekhe.

[@gamingloverhimangshu4562]

Good

[@sakshigoyal6143]

For a complete graph with n vertices the total number of spanning tree...???

[@AK-fn7ro]

N^N - 2 not sure

[@ravidravid5789]

Tq ❤️❤️

[@mantasha2586]

So what is the difference between spanning tree and minimal spanning tree?

[@codertypist]

A graph can have many spanning trees. For each possible spanning tree, find the sum of the weights of all the edges. The spanning tree with the smallest total is the minimum spanning tree (MST). Let's say you wanted to build roads to connect several towns. Building roads is expensive, so let's say that you wanted to build the least amount of roads possible. Finding a spanning tree would minimize the number of roads you build. However, since there are many possible spanning trees, some may be more expensive than others. Finding the minimum spanning tree would give you the "shortest" spanning tree. This would mean that you have to build less road. This could save you tens of thousands of dollars.

[@mantasha2586]

Ok thankyou sir..

[@dharmaputra7394]

Implement with code 🙏

[@abhishekmohanty232]

If u connect d to e in the second question of minimum spanning tree then it will be even shorter

[@adityaguin4913]

No, because either 1) You make a cycle, which isn't allowed 2) The weight from D -> E is 8, which is considerably "heavier" than the other edges so in either case you won't have a minimum spanning tree

[@anime_thrones_endgame]

Please make a video on... WARSHALL'S algorithm... 🙄🙄🙄🙄🙄🙄🙄🙄🙄🤔🤔🤔🤔

[@akashmaurya563]

play at least 1.75X nice videos

[@sumeghmadawale6184]

At 12:00 u missed e to d with weight 3 wrong answer

[@prathameshbagekari7966]

Thats 8 not 3