02:00 Minimum spanning trees are a subset of a given graph that contain the same number of vertices and a number of edges that is equal to the number of vertices minus 1. 04:00 Minimum spanning tree is a tree that contains the same number of vertices as the graph and the number of edges in the spanning tree is one less than the number of vertices in the graph. 06:00 The minimum spanning tree is the spanning tree with the lowest total edge weight. 08:00 Minimum Spanning Tree (MST) is a tree with the minimum edge cost among all the possible spanning trees. 10:00 Properties of Minimum Spanning Tree 12:00 A complete graph of 4 vertices can have maximum 16 spanning trees. 14:00 A complete graph has all pairs of vertices connected by one edge 15:58 Properties of Minimum Spanning Tree
Due to this covid education system is done with online classes etc .....during this period no one can concentrate on the topics which are told by the lectures. And when the exams has arrived each n every person is learning the subject to get pass marks .........we do not understand the topics when we open the books r PDFs without listening ....at dat tym Jenny's lecture is the best source for understanding every topics pin to pin so dat uh can write the xam very well n score the good marks . Tq Jenny's lecture for all the vds n making us understand n get a minimum thought of that topic .
Small help for English students: Conversion of each Hindi sentence/words in English.Sorry for 1 second + - 0:34: Now spanning tree of this graph would be 3:31: So, Many spanning trees 6:20: Minimum spanning tree is that whose total cost/weight of spanning tree is minimum out of all spanning trees' minimum cost/weight. 7:27: Ok, see 7:38: If you remove a single edge, a single one than that spanning tree would be disconnected 7:55: So as many as edges in the spanning tree 8:13: Distinct means different weights/costs, which means there is no same weight of any edge. 8:21: There will only single MST and that would be unique 8:26: If the edge case is not distinct then 8:31: Suppose we have one graph and which has two or three edges whose weight is same this this this like that ok 8:47: And 9:17: This is the condition when edge weights are 9:33: Talking about a complete graph. Complete graphs are those if each vertex of that graph is connected with another vertex. 9:53: Here n is n to the power n-2, where n is the number of vertices of that graph. 10:35: This will not happen that the graph is connected and it has no spanning tree. And that is not possible at least it has one spanning tree. 10:57: Ok 11:22: Ok 11:32: Maximum edges can be removed are 12:06: So maximum edges you can remove from this graph are 12:10: What are its spanning trees, and spanning trees properties are 12:24: Means how many edges 13:00: So maximum edge you can remove only one 13:04: We removed 1 and we got this spanning tree 13:50: Complete graph has this property 13:55: Now one of Its spanning trees, let us first draw all of its vertices. 14:06: Number of edges would be 14:13: Three edge could be that 14:35: So maximum edges you can remove from this graph is (e-n+1) 14:41: How many numbers of edges 14:58: Ok, and how many edges we removed from this graph are: these three edges we have and we removed these three edges and if you remove another edge then this graph would be disconnected. 15:20: So the maximum you can remove only 15:32: Main properties, I already told you that there would be the same number of vertices and edges would be 15:47: One more property of spanning-tree we can add Love you from India.
in pandemic students fells very deficulty thank you so mcuh please upload these kind video you explain in polite manner which comes explain in one time
05:55I didn't understand how it could be possible to visit the vertices of the number 5 twice. . . thank you and I appreciate your hard work keep going
Simply Amazing. 😀 Tomorrow 12:00 PM is my Operations Research (OR) Exam and I googled just now "minimal spanning tree youtube" and found this video of yours link on second rank. Really helpful in creating concepts before reading lectures or books of MST. Do you have video series on other concepts of OR?
Mam you are awesome.Firstly you look so humble and pretty(obviously),secondly you give crisp knowledge.Mam pls try to discuss gate questions after completing concept. Seprate video for pyq and practise questions.
Thanks a lots madam i really understand your class more clear and understandable please video s much as easy way to easy too understand LOve you madam❤❤❤❤❤
That last property why is it written maximum, shouldn't the term used be 'exactly' in place of 'maximum'? Also, why only complete graph, won't all connected graphs holds that property true? e - n + 1 = e-(n-1). and (n-1) is the number of edges in a spanning tree, therefore, in all connected graphs having 'e' edges, we have to remove 'e-(n-1)'. == 'e-n+1'. Exactly. Am I wrong?? Please reply.
Thank you so much, I am pretty much clear about the topic, just I am not confident in the point why is E' needed to be |V|-1 ? Could anyone explain me? Thanks in advance.
Explanation soft and beautiful.... And one observation not related to study..you should have tried the Chinese chopstick hairstyle instead of that pink clip..
The maximum number of STs possible is also dependent on number of edges? Like in last Example 6 edges were there, but the graph can be made out of 4 edges, then the STs would not be 16, isn't it?
G 244 two condition of spaning tree 1. V'=V 2. E'=|V|-1 note: spanning tree should not contain any cycle note: To find Minimum spanning tree, eliminate maximum costed edge note: golden basic from7:19-final
mam, why removing max(e-n+1) edges makes a graph ST? if we remove less than (e-n+1) edges will it make a Spanning tree(ST)? I mean shouldn't it be 'only' (e-n+1) instead of 'max'(e-n+1) edges
Also explain the complexity of these algorithms like Kruskal, Prims and Dijk stra , which one is better algorithm in average case ,best case and worst case
02:00 Minimum spanning trees are a subset of a given graph that contain the same number of vertices and a number of edges that is equal to the number of vertices minus 1.
04:00 Minimum spanning tree is a tree that contains the same number of vertices as the graph and the number of edges in the spanning tree is one less than the number of vertices in the graph.
06:00 The minimum spanning tree is the spanning tree with the lowest total edge weight.
08:00 Minimum Spanning Tree (MST) is a tree with the minimum edge cost among all the possible spanning trees.
10:00 Properties of Minimum Spanning Tree
12:00 A complete graph of 4 vertices can have maximum 16 spanning trees.
14:00 A complete graph has all pairs of vertices connected by one edge
15:58 Properties of Minimum Spanning Tree
Due to this covid education system is done with online classes etc .....during this period no one can concentrate on the topics which are told by the lectures. And when the exams has arrived each n every person is learning the subject to get pass marks .........we do not understand the topics when we open the books r PDFs without listening ....at dat tym Jenny's lecture is the best source for understanding every topics pin to pin so dat uh can write the xam very well n score the good marks . Tq Jenny's lecture for all the vds n making us understand n get a minimum thought of that topic .
Right
Small help for English students: Conversion of each Hindi sentence/words in English.Sorry for 1 second + -
0:34: Now spanning tree of this graph would be
3:31: So, Many spanning trees
6:20: Minimum spanning tree is that whose total cost/weight of spanning tree is minimum out of all spanning trees' minimum cost/weight.
7:27: Ok, see
7:38: If you remove a single edge, a single one than that spanning tree would be disconnected
7:55: So as many as edges in the spanning tree
8:13: Distinct means different weights/costs, which means there is no same weight of any edge.
8:21: There will only single MST and that would be unique
8:26: If the edge case is not distinct then
8:31: Suppose we have one graph and which has two or three edges whose weight is same this this this like that ok
8:47: And
9:17: This is the condition when edge weights are
9:33: Talking about a complete graph. Complete graphs are those if each vertex of that graph is connected with another vertex.
9:53: Here n is n to the power n-2, where n is the number of vertices of that graph.
10:35: This will not happen that the graph is connected and it has no spanning tree. And that is not possible at least it has one spanning tree.
10:57: Ok
11:22: Ok
11:32: Maximum edges can be removed are
12:06: So maximum edges you can remove from this graph are
12:10: What are its spanning trees, and spanning trees properties are
12:24: Means how many edges
13:00: So maximum edge you can remove only one
13:04: We removed 1 and we got this spanning tree
13:50: Complete graph has this property
13:55: Now one of Its spanning trees, let us first draw all of its vertices.
14:06: Number of edges would be
14:13: Three edge could be that
14:35: So maximum edges you can remove from this graph is (e-n+1)
14:41: How many numbers of edges
14:58: Ok, and how many edges we removed from this graph are: these three edges we have and we removed these three edges and if you remove another edge then this graph would be disconnected.
15:20: So the maximum you can remove only
15:32: Main properties, I already told you that there would be the same number of vertices and edges would be
15:47: One more property of spanning-tree we can add
Love you from India.
great work bro
Thanks a lot
Thank you, from Tamil Nadu.
gg
you deserve Noble bro
this is a great help for people like me who's preparing in last minute😌
Yes bro this is very helpfull for people like me and you who preparing in last minute
@@arsalanalam8195 🤣🤣🤣🤣🤣i wonder how people who dont study in last minutes understand
after three years. where are you?
@@MUSAFIRBEFIQR working at Bosch!
Thank you so much for your amazing videos on data structures it has been really helpful for my studies.
abla sen olmasan ülkenin yarısı kalacak Thank you for all those, you are hero
Add More Lectures of Operating system , best Lecture For Data Structure, really appreciative
in pandemic students fells very deficulty thank you so mcuh please upload these kind video you explain in polite manner which comes explain in one time
You are amazing mam.i just wished that you should be our college teacher.
Thanks, a lot maam your videos are amazing and help me a lot in DSA and also in Artificial Intelligence. Huge Respect from Pakistan
Tomorrow is my terminal exam and this helps me completely, now I'm going for merge sort and insertion sort.
Thanks and respect for this. 👍👏
Congratulations for 100k. Big fan of your teaching. Keep on uploading such videos
Thanx mam for saving my semester
Visited so many channels and dived through so many internet resources but find your teaching easy to get.
05:55I didn't understand how it could be possible to visit the vertices of the number 5 twice.
.
.
thank you and I appreciate your hard work keep going
Thank you ma'am you teach really well 😊
i have started learning DS and hindi in her DS lectures , very efficient )))
Beauty with brains...!
When I come here to learn something, I do not check comment section....Thank you so much Madam.... ❤❤❤❤❤❤❤
Ur explanation is simply perfect 🤝
You are awesome in teaching.
Please keep on making video on CS thank you☺
Explained really well, respect from Pakistan.
Love from India ❤️ the way you explain is awesome 😊😊
Simply Amazing. 😀 Tomorrow 12:00 PM is my Operations Research (OR) Exam and I googled just now "minimal spanning tree youtube" and found this video of yours link on second rank. Really helpful in creating concepts before reading lectures or books of MST. Do you have video series on other concepts of OR?
your explanation is so thorough and clear! amazing.
U are explaining very clearly, u have cleared all doubts 👍
Can you please upload video on AA TREE and RED BLACK TREE 🙏
Will upload soon.
Mam you are awesome.Firstly you look so humble and pretty(obviously),secondly you give crisp knowledge.Mam pls try to discuss gate questions after completing concept. Seprate video for pyq and practise questions.
Thanks a lots madam i really understand your class more clear and understandable please video s much as easy way to easy too understand LOve you madam❤❤❤❤❤
Thank you mam..you just make data structure easy for me that is crystal clear now..Again Thanx a lot
The way your explanation is awesome thanks for sharing knowledge 👍👌 keep doing it, if possible do some programs in data structures happy learning :)
Thank You Mam So So Much🙏🙏🙏🙏
Mam is so cuuuutee 🥺🥺🥺🥺
Explain concept at left side of the board And algorithm at right side of the board .....so that viewers can understand the concept clearly
Love ❣️ from vizag😍😍
Mam your explanation is very well ..tq u so much mam
Mam u r doing really a great job
And ur videos of teaching r very helpful for us thank you so much 🙏
Hattsoff to ur work👍
Excellent 👌 work Mam
super complete! Thank you so much!
this is example of brain with beauty...
Mam I love you 💟😘😘😘
Perfect explanation.
love u mam
mam jis jis ki crush hai woh like kre
Maam I am mechanical student but by your lecture video I managed to study my data structure
That last property why is it written maximum, shouldn't the term used be 'exactly' in place of 'maximum'?
Also, why only complete graph, won't all connected graphs holds that property true?
e - n + 1 = e-(n-1).
and (n-1) is the number of edges in a spanning tree, therefore, in all connected graphs having 'e' edges, we have to remove 'e-(n-1)'. == 'e-n+1'. Exactly.
Am I wrong??
Please reply.
Tq so muchh mam 💖
Good Explanation, super
u make it easy mam..
Love u mam 😍😗🤗
Awesome Ma'am,:)
Thanks a lot, this very helpful for me,,.
Thanks a lot mam.
Thank you so much.
It will help me alot.🙏🙏🙏🙏🙏
Thank you so much. Keep up the good work .
Thank you so much. You explained really well.
Thank u maam.Im frm sri lanka
Excellent Explanation
You are my new ma'am
Thank you for such a sweet explanation
wouldn't the e-v+1 propety be true for every graph not just a complete graph?
Just wow ❤️
Mam please more videos on data mining and warehousing please
Love the way you explain 👌👌
Well explain mam,,,,,thanku so much 😇
Thank you so much, I am pretty much clear about the topic, just I am not confident in the point why is E' needed to be |V|-1 ? Could anyone explain me? Thanks in advance.
Mam could you please tell how to implement it
Tq mam for explaining us
A sweat girl/madam with quality of working hard.I mean wow..........
Mam..u cover important formulas and concepts which will help in competetive Exams....Really Thanks to u Mam.....
Explanation soft and beautiful....
And one observation not related to study..you should have tried the Chinese chopstick hairstyle instead of that pink clip..
😂😂bhai padhne aya hai balo ko dekhne
The maximum number of STs possible is also dependent on number of edges?
Like in last Example 6 edges were there, but the graph can be made out of 4 edges, then the STs would not be 16, isn't it?
Yes I made all the ST's there are only 12 not 16. Then I calculated the formula too. It came out to be n!/2
Thnk u maam, it help me to solve the problems thnk u so muchh
Mam we give one formula to find number of spanning tree by using vertices but, that formula is applicable for any number vertices
Really helpful....♥
G 244
two condition of spaning tree
1. V'=V
2. E'=|V|-1
note: spanning tree should not contain any cycle
note: To find Minimum spanning tree, eliminate maximum costed edge
note: golden basic from7:19-final
Hi, you said that disconnected graphs can't have STs but what if I have 3 connected components then can't we have 3 MSTs?
Thankyou mam u helped me a lot♥
amazing videos ..........
Super explanation mam
Hi.... could you please explain about tree decompositions in detial.......
Thanks so much 😍
Router and switches using spanning tree data structute. Now I understand this
thanks for your pure explanation ,you are amazing .Egypt
Thank u ma'am for that amazing explanation
What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?
Thank You Madam 🙏
Very helpful thank you
very use full madam
mam, why removing max(e-n+1) edges makes a graph ST? if we remove less than (e-n+1) edges will it make a Spanning tree(ST)? I mean shouldn't it be 'only' (e-n+1) instead of 'max'(e-n+1) edges
Good video teacher
Please consider a lecture on string matching techniques
Bro idhar milega kuch dino mein
th-cam.com/video/P0dmKnLJG4c/w-d-xo.html
Amazing ma'am 💕😍
Thanks mam 😊
Thank you so much!
Thanks
How to find the weight of edges.
Please help me with these thing
Thank you so much
Good language
how to calculate weight of edges??
Also explain the complexity of these algorithms like Kruskal, Prims and Dijk stra , which one is better algorithm in average case ,best case and worst case
HTML, CSS and JavaScript pr bhi video bnaiye 🙏 please !
mam plz tell what is edge weight???
the difference between a graph and tree is: grph must have cycle and tree must not have cycle? only one node is a tree or a graph?