Dear mam, you should continue doing more videos it really helps so much :) your explanation is very simple to understand and direct ready for exam thanks!
Thank you ma'am. Tommorow is my exam. By looking in to the questions ,it seems to be tough. But its really easy with your "minimum minute" video! Thanks alot
No one’s making infographic yet I wonder why. Or is it just not publicly available like the ones for the primary school students. Perhaps it’s time to make some for all usingAI?
Ma'am, please do videos 🙏. You are amazing. It's been 5years since you uploaded. Currently, your videos are helping a lot to understand the concepts better. Thank you for your efforts.
you're not choosing the minimum weight among the neighbours of the last vertex you visit, you are instead looking for the minimum weight you can choose from the whole graph, except the ones creating a cycle.
make two list, one for included vertices and another one for rest of the vertices put vertex a in included vertices list and find the adjacent vertex connected with a having minimum cost
i think because we are aiming always for the minimum value between edges , so we had one where it weight was 6 and one was 10 which is what you were talking about and since 6 is less than 10 we take that edge
I think you need to start with an edge with minimum cost first, else we I'm not getting a minimum spanning tree rather just a spanning tree. I did both ways and compared their costs, it makes more sense to start with the vertex with lowest cost path attached. Please do let me know if I'm wrong.
Maam please don't stop making videoes..Its really helping students to understand the concepts with great clarity
Indeed.
Very clear, neat, clear voice, good writing, multiple colors, explanation, all is just awsome
Very well done, short, quick and very clear, understandable lesson, good to recommend
Very.
Dear mam, you should continue doing more videos
it really helps so much :)
your explanation is very simple to understand and direct ready for exam
thanks!
sach me bhai sahi bol rha hai
Totally in love with the simplest way in which you coved this topic.🔥🔥❤️❤️
Clear and to the point videos, Really very helpful, Thanks ma'am !!
Thank you ma'am. Tommorow is my exam. By looking in to the questions ,it seems to be tough. But its really easy with your "minimum minute" video! Thanks alot
Mam ur voice is perfect for studying 😸
Wow, very well done. Clear and precise explanations. Awesome work.
You're amazing. It is because of your video the whole concept was crystal clear in just one go. Keep making these type of videos.
No one’s making infographic yet I wonder why. Or is it just not publicly available like the ones for the primary school students. Perhaps it’s time to make some for all usingAI?
Much thanks !!!! Explained it in less than half the time most others did ...thank you
Dear mam. You teach so well. Learning is easy by seeing your videos. Thanks a lot mam.
Ma'am, please do videos 🙏.
You are amazing.
It's been 5years since you uploaded.
Currently, your videos are helping a lot to understand the concepts better.
Thank you for your efforts.
4:15,y not add c which will not perform cycle and also connected to e?
Because b is first connect by a so either e has higher value so we take b
@@NeymarJr-b2q this does not really answer the question ... i was wondering why we didn't conneect e to c too
Good work. Also motivate the readers to think about why the Prim's algorithm is correct, if a formal proof is going to take another video.
Your the best via making someone understand.God bless you
Madam ❤ Life Saver truly hats off🎉 May God bless you maam❤❤❤
thanks for this tut i love it, its is easy to understand
Thankyou Lalitha, best explanation I found and because of that i was able to complete my homework!
Thank you for this presentation it help me for understanding this topic very much .🥰
I mean how are you so good at explaining !!!!! FIRE🔥🔥🔥🔥🔥🔥🔥🔥
4:53 since we cannot go to B , why not go to C?
Haa... wahi bol rahi hu
Thanks a lot.Your explanation is very clear and good.
Loved the way u explain,...n also..d presentation is nice....as compared to othr tuto...expecting more of these engineering sub vdos🥰🥰
Magnificently arrange perfect example outstanding explanation.. evrything you explain so smoothly. 💯💯💯
You have nice voice and nice penmanship. Thank you for your help! Satisfying video.
This video explains better than my professor
Thanks for the clear message with a clear accent👏
You made it so easy to understand, thank you so much !
excellent explanation ma'am ; thank you for making it easy to understand . hats off :)
3:43 when we took edge1 from b then why we again take 4 edge from b again?
It's always go to the minimum edge
life saver for last min preparation ♥
Clear explanation...got it in 1st watch...easy and effective example
Nice Handwriting 👌🏻
Your explanation is sooo. Good madam, easily understanding...
love it ....u save my 30 marks in 2 hrs
😇
Ma'am thank you soo much yu really helped me out 🎉🎉keep doing this vids they are short n precise
Too good explanation
Kindly upload more educational videos🙏
Ur writing is really cool❤️
Darling, you saved me so much time with all your videos. thank you :)
Ur way of explaining is wonderful ...loved it. ..carry on u will rock ..
Thank you Miss Saifi Dholalal for giving her your compliment
gem of a content 🤍
very simple and quick to understand thank you!
very simple and quick to understand thank you!
😃😃😃😃😃😃😃
you are a good teacher.. thumbs up
You teach this better than my professor
Well explained. Very useful for my preparation. God bless u
very clear. great tutorial. tomorrow cat exam.
Ma'am why was c not visited after visiting e ?
Why did we go to b again to connect it to g?
you're not choosing the minimum weight among the neighbours of the last vertex you visit, you are instead looking for the minimum weight you can choose from the whole graph, except the ones creating a cycle.
@@sogan754So that's gotta suggest that we're allowed to ladder back to already visited vertices then?
thankyou ma'am
Precise and concise. Keep it up.
Nice nice explanation mam...
Thank you sm
Ur explanation very well. Tq
Why didn't you go for 'c' after 'e' as 3 couldn't be chose as because of cycle but 10was also their???
Reply please!
we choose the edge with the lowest cost, the lowest edge didn't have a value of 10, it had a value of 4, so we chose that edge
Same doubt..
The value 4 is an edge connected to b,not 'e'...why did we leave 10
Yes She then went to b without any reason
make two list, one for included vertices and another one for rest of the vertices
put vertex a in included vertices list and find the adjacent vertex connected with a having minimum cost
best explanation and clear concept
Presentation is very lovely
Masha allah sis keep helping students 🙏 💕
you are the best . small video yet helpfull
She taught so easily thank u mam
Explained very well👍👍
Voice like alexa🥰
Thank you😀. Very well explained 👏
Very good teaching 👏🏼👏🏼
The best explanation
The lecture is easy to understand 🥰
Well explained .... Thanks alot
Thank you mam for such a great explanation..
Amazing Video
Thank You Mam
hi mam, why did you stop making videos? You have done a very good job this far. Please do resume making videos.
why dont we join e and c when it comes on e point
It will form a cycle
Best explanation ever
Mam your videos are very helpful to all students so please make a video on other topics also don't stop it please 😔
Your videos is great and helpful thanks but I have only one doubt why you didn't take 10 edge it doesn't create a cycle
Thank you for explaining👍🙏
Tqqq so much and it's easy method to understand 😍🙏
Your voice has a magic 😌
Excellent explanation
Thank you I understand easily 🙏🙏🤞
very nice explanation.
Why didn't we include the edge connecting e and c if it is to be traversed only through connections?
i think because we are aiming always for the minimum value between edges , so we had one where it weight was 6 and one was 10 which is what you were talking about and since 6 is less than 10 we take that edge
boss ap ki videos to kmal hainnn
Thanks mam it is very very useful to us❤
Your voice is so sweet and soothing 🥰
Great Lesson .. Thanks !
very well explained 👍🏻
Short period of time but clear explanation
Thanks Ma'am God bless you.
Why can't we add 10 after 6? It doesn't form any cycle right?
Yes does, so we can't
Did you use a professional camera to shoot this video or mobile phone? Your presentation is pretty nice.
Where I was from this many days❤️
how do you detect a cycle? other than looking at it.
Good explanation mam ❤
I think you need to start with an edge with minimum cost first, else we I'm not getting a minimum spanning tree rather just a spanning tree. I did both ways and compared their costs, it makes more sense to start with the vertex with lowest cost path attached. Please do let me know if I'm wrong.
Yeah! It's totally wrong
hello mam, could you please explain how you are assuming values for the tree. i.e 1,2,3,4, etc for connecting trees a-b.
Why didnt you choose 10 from e
Because we have to make minimum cost spanning tree
EC cost very high 10
It will create a cycle
Mam where are you now your teachings skills are just wow
thank you for this exmaple every thing is clear know ;)
Can I change from "It does not form a cycle" to "both ends are not visited"?.
Thank you so much for the simple concise tutorial.
you explain so well
Mam please can you explain how to choose 2 has minimum distance
Hii mam I have a doubt why you can't add "e"and "c"