Spanning Tree - Minimum Spanning Tree | Graph Theory #12

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

[@afzabashir7958]

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

[@neniscarlet3880]

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

[@sawjankumarshanu4394]

Mind-blowing class brother.

[@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

[@S1997-k5t]

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]

@@S1997-k5t what is wait how to know wait

[@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" ?

[@SandipDas-bd2pt]

Thank you for spaning tree . It's helpful.

[@divya_agin]

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

[@mifkamorphosis]

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

[@manjirasaraekanayakaalphys9256]

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

[@techbeauti]

Great Explanation!

[@matalavedika9375]

The way u explained is super Thank U sir.

[@PeterOsiliaguedez]

Clear and very well explained.

[@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

[@chndrikaakkiraju9033]

Good explanation and gud voice clarity tq

[@gayathrigirishnair7405]

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

[@BRANDOJHAKSAELARMAS]

a lot of love from Italy. Thank youuuuuuuuuuu

[@sinenhlanhlamthiyane574]

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

[@nachogallego1075]

thx bro you save me for my exam tomorrow :)

[@anujashaju5425]

Well Presented..... Really appreciable

[@hemanthyadav2177]

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

[@suhailchandio]

A fabulous way to teach

[@janakisowmya91]

Very clear explanation sir

[@piyushkhanna7430]

superb sir

[@iramabbas9455]

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

[@rajkrishna1933]

Excellent explanation

[@calebkrauter4027]

SO helpful. Thank you.

[@shaymapathan1383]

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

[@Incredible2India]

😂

[@Incredible2India]

पढाई pr dhyan do beta 🤣🤣

[@ИльяКоннов]

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

[@ViduraDhananjaya]

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

[@paramjeet047]

Really helpful thanks for this

[@mitalkhapandi8617]

Superb explaination 👌⭐

[@khaledalharbi911]

Great Explaination , Thank You

[@Anilkumar-Ch17]

made it clear brother..thanks

[@mayank19saxena]

Very well explained!

[@MrAbsinator]

God bless your work thanks man

[@abhigyanraha5620]

very good explanation

[@nkirukaodu3349]

Well done, You really helped

[@hargunsandhu8833]

Best teacher

[@kendrahutton7971]

Thank you very much for this tutorial. Pardon me, I am having difficulty understanding whether he's saying circuit or cycle, help please?

[@JavaAidTutorials]

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

[@rahulsrinivasan7919]

thank you so much! easily understandable

[@chinnadurai8473]

Thank you sir for clear explanation

[@pavankarantotu5335]

Very nice sir 👌👍👌👍👌

[@subashini288]

thank u sir your videos are very useful for studies

[@kovan111]

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

[@mariatheresalouis8540]

super helpful! thank you so much!!

[@Hmmwyd]

Great video thank you!

[@bkhomseehomsee9091]

very excellent ! you can be like boss.

[@olanature1]

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

[@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

[@hardikanand6153]

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

[@Understanding_the_world_withme]

Thank you very much sir.

[@idreesfatima38]

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

[@kunalkashyap5487]

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

[@engineerfred9427]

Thank you very much🥰🥰

[@anime_thrones_endgame]

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

[@sanketnaik738]

Thank you sir ❤️

[@shwetabandgar6862]

So nice explain

[@bhavyaanbarasan7919]

Excellent can you please do a video an decomposition of graph

[@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

[@anamikaroy1120]

Thank you sir

[@aparnamurugaiyan8139]

Thanks sir 👍

[@quocbaonguyen4450]

thank you

[@chamarthykoushik204]

Nice class sir ☺️😊👍

[@sahilprasantachoudhury911]

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

[@nilufarbagherzadeh8157]

perfect perfeccccctttt thank you so much

[@thereselauritano361]

so helpful

[@mayuripatel2842]

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

[@drishtijain2161]

Value is 8.

[@rwnsaad9738]

thank you so much

[@anime_thrones_endgame]

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

[@husnainumar2099]

thanks brother

[@sachinmaurya3259]

nice video

[@annesarahC137]

thanks!!

[@beefymcwhatnow6233]

thanks bro

[@ravidravid5789]

Tq ❤️❤️

[@nirajmohanty5769]

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

[@S1997-k5t]

ed have 8 weight not 3 .

[@tr3251qw]

thanks a lot !

[@DevRaj-to2yn]

Don't u think that the first example does not form a path

[@sumeghmadawale6184]

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

[@prathameshbagekari7966]

Thats 8 not 3

[@roopabeethoju9498]

How to take that minimum weight number

[@arpangupta2162]

it was A GOOD VIDEO

[@swatibagul3161]

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

[@betavenomlite6379]

Tq sir ❤️

[@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

[@Yayin-me]

Is it bft and dft

[@betelhemnegrew7068]

thank you so muche

[@akashmaurya563]

play at least 1.75X nice videos

[@shaikmufez2838]

Nice

[@dharmaputra7394]

Implement with code 🙏

[@gamingloverhimangshu4562]

Good

[@aishwaryaningam5144]

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

[@gsharthika592]

Thanku sir

[@ruth5746]

how to find the weights for edges?

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

[@amitmauryathecoolcoder267]

Thank you , bhaiya.

[@rajkumarsuryavanshi8136]

Bhava gaav kont re tuzz...??