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.
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
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
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.
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
![แม่กลองสองใจ - ซีแกรม โตเกียว มิวสิค [ OFFICIAL MUSIC VIDEO ]](http://i.ytimg.com/vi/GSQfVjcr_f4/mqdefault.jpg)
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.
Perfect lecture speed. Thank you for making it to explicit !
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
Your videos are helping me understand these concepts. You explain well. Thank you.
You really helped me study for my exams. Keep up the good work!!
Could you add to your content topics from "algorithms and complexity" ?
I have been cramming for exams! And your video really has given me a good understanding of the topic! Thank you so much!
Thank you for spaning tree . It's helpful.
Thank you, sir. This video helps me to understand the basics of this topic 'Minimal Spanning Tree'
Mind-blowing class brother.
Thank you for a clear and concise explanation. Please do make videos on other topics related to computer science.
Yr videos are amazing, it's too helpful for all of us,Keep it up. 👍👌👌
Clear and very well explained.
The way u explained is super Thank U sir.
A fabulous way to teach
Great Explanation!
Well Presented..... Really appreciable
Excellent.l prepare my exam topics from your channel. Its help me a lot.
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
a lot of love from Italy. Thank youuuuuuuuuuu
Good explanation and gud voice clarity tq
Well done, You really helped
your explanation is so easy to understand sir. thank you very much
SO helpful. Thank you.
Very well explained!
Thank u very much.I'm from Sri Lanka.good luck❤
Great Explaination , Thank You
thank you so much! easily understandable
You made me enjoy mathematics and you make it easy for me to study for exam
thx bro you save me for my exam tomorrow :)
Excellent explanation
Hello, very informative video. please can you explain the Radio mean number of a graph?
God bless your work thanks man
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
e-d have weight 8 not 3
What is wait how we know the wait off the edge
What is wait how we know the wait off the edge
@@user-ye7kn6kd3d what is wait how to know wait
Great video thank you!
What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?
Excellent can you please do a video an decomposition of graph
Really helpful thanks for this
made it clear brother..thanks
Excellent👍💯 sir easily to understand thank u helpful to me
Very clear explanation sir
very good explanation
thank u sir
your videos are very useful for studies
super helpful! thank you so much!!
Awesome job man. You just saved my ass in exam. #hatsoff
Thank you sir for clear explanation
superb sir
Superb explaination 👌⭐
Great job keep it up brother ur video is really helped mee soo thanks alott
how to find the weights for edges?
great keep it up...make more vedios on graph theory..
Best teacher
You have a very nice smile :) Thanks for this tutorial.
😂
पढाई pr dhyan do beta 🤣🤣
Hello sir ,can u say about breath first search and depth first search in spanning tree
omg this explanation is so much better than what I was taught in uni. university is a joke lol
Thank you very much sir.
very excellent ! you can be like boss.
wooow bro. you are a very good teacher you thank you
thank you so much
Thank you very much🥰🥰
Nice one brother. Good explanation...(Y)..#JAVAAID
Thank you sir ❤️
Sir l watched your videos which was very good.
Can you make video on Group and rings of discrete mathematics.
perfect perfeccccctttt thank you so much
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
So nice explain
How to take that minimum weight number
so helpful
thank you
Sir ed edge have weight is 3 so it should be counted replacing fd edge having weight 4
ed have 8 weight not 3 .
Thank you sir
thanks a lot !
Bhava gaav kont re tuzz...??
thanks!!
Very nice sir 👌👍👌👍👌
Thanks sir 👍
Maximum number of spanning trees connected graph with n nodes are...?
N^N-2
nice video
Sir e to d is possible without cycle its value is 3 so why you didn't take that???
Value is 8.
thanks bro
e to d=3 possibility without cycle in minimum spanning tree in 2nd example
That's exactly what I was going to do xD (comment about that possibility)
e to d costs 8 and not 3. Look again closely.
@@drishtijain2161 mmm you're right :o
thanks brother
it was A GOOD VIDEO
Self referential note: ae video pare Prim's algo au Kruskal's algo video dekhe.
Super bro... 😘😘😘😘😘😘😘😘😘😘😘😘😘😘😘😘😘
Sir i have a problem in graph theory...i need your help
Implement with code 🙏
Tq sir ❤️
For a complete graph with n vertices the total number of spanning tree...???
N^N - 2 not sure
Tq ❤️❤️
So what is the difference between spanning tree and minimal spanning tree?
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.
Ok thankyou sir..
Thanku sir
Nice
Nice class sir ☺️😊👍
Good
Please make a video on... WARSHALL'S algorithm... 🙄🙄🙄🙄🙄🙄🙄🙄🙄🤔🤔🤔🤔
Thank you ,
bhaiya.
thank you so muche
If u connect d to e in the second question of minimum spanning tree then it will be even shorter
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
play at least 1.75X nice videos
At 12:00 u missed e to d with weight 3 wrong answer
Thats 8 not 3