I HONESTLY SPEND AN ENTIRE DAY LOOKING FOR A GOOD SOLUTION TO PRIMS AND I AM SO HAPPY I FOUND IT. THANK YOU SO MUCH FOR THIS . YOU GOT A NEW SUBSCRIBER
I thought I had my answer at about :20 into the video But I wanted to make sure so I watched until about 1:30 and my answer was confirmed About 1:30 plus the 2 minutes searching google to find your video or "read" 40 pages of death to maybe find the same conclusion I'll pick the 2 and a half minutes with you every time! thanks for this awesome video that cut the BS and got straight to business - no frills no BS new subscriber!
How would you do it if you can’t backtrack? You went from C to I and the C to F. If you had to continue from the last point you reached, how would you make it efficient?
at 5:17 we can not select AH not only because it would create a cycle but because A and H are already discovered before...so there is no need in examining those 2 edges at that moment Great explanation though!! clear and to the point!!! love your videos on Kruskal's and Dijkstra as well!! :D
I have a question b-c and a-h are basically ties because their distances are the same so why after choosing a-c did we not choose a-h ? But rather chose c-i ?
So is it safe to say, that this video finds the shortest solution one could travel to get to all locations? Meaning that every node must be reachable, but it's the most effecient way to reach all nodes? I'm strugling with this a bit because you could take the road from A to H and get there much faster that going way around.
Does it mean that we have to stop selecting edges until most edges that do not form a cycle will be selected? Then that would be the time the MST is already completed?
at 5:01, why didn't you consider g to i because cost is 6 which is less than 7? i know it will create a loop but you did not even mention it? is there a reason or you just overlooked it by mistake ? thank you
at 4:44 "number 7 seems to be the lowest out of all of them. pay attention we can't choose this as it will create a cycle and we can't have a cycle in prim's algorithm."
I have a question, why would i not be able to simply look at every node and assume that the cheapest path for that node was one that would be a part of the minimum spanning tree?
Thank you for the timely response, my goal isnt to find a minimum spanning tree but instead find the sum of the value of all paths that must be taken. so i was wondering if i could instead look at each node in the input independently and simply take the cheapest path for each node?
Tamil Student No, it’s still 37. If you take a to h after a to b, then we will then take h to g, then g to f, then f to c, then c to i, then c to d, then d to e. The total will be 4+8+1+2+4+2+7+9 = 37.
This is the most clear explanation I've seen. It contemplates everything, Thank you!!
thank you so much!
I wish I could agree, but there was not explanation why we must consider all the edges that he rattled off after getting to a node.
@@jacoblopez6365 was pretty clear to me to be honest
saved me during finals man absolute stud
Note: the spanning tree is not unique. Removal of edge (b,c) and replacing it with (a,h) gives a spanning tree with the same total distance.
thank you, just finished coding and my algorithm chooses a-h first
You really should explain this using a queue as this is really the back bone behind this algorithm and is an easy way to show how to choose a path.
that is true, i should have. Maybe i ll upload another one
awesome video man, was struggling at first to get the concept and you helped nail it down for me. thank you!
Thanks a million Sir 👍👌🔥
4 years before but hasn't lost the charm 👍
I HONESTLY SPEND AN ENTIRE DAY LOOKING FOR A GOOD SOLUTION TO PRIMS AND I AM SO HAPPY I FOUND IT. THANK YOU SO MUCH FOR THIS . YOU GOT A NEW SUBSCRIBER
i am glad i can help :) thank you so much for the sub!
love you from the bottom of my heart. now i can make all my friends beg me to help them HAHAHAHAHA
lol unless they see this video
Great explanation! Much better than my book and I finally understand it
Thank you so much. I was baffled with so many videos.But yours tutorial took my concepts on the track.
thank you very much! i am glad my videos are helpful
Brilliant! Thank you for your clear explanation.
This is the most clear explanation I've seen. Thank you so so so much
Your video helps me a lot. Thank you for your great work!
best explanation for prims algo that I've found
Made me understand it in minutes!! Thank you!
Simple and easy. Great job dude!
thank you
this is an excellent explanation. This will definitely help me for my data structures exam
thank you and good luck
Genuinely clear explanation. Thank you!
I have a Decision Sciences exam on Monday (today being Saturday 1am) and you helped me cover 20% of a section in 6 minutes. Thank you kind sir
i am glad i could help, thank you for the comment!
Thanks a lot ....after a lot of search I got this helpful explanation.
No wonder they say it's a surprisingly easy algorithm! And yet quite difficult to teach for some
Thanks, you confirmed that my professor messed up in grading our homework, thanks
Get as many points as possible, they add up at the end.
This totally helped me, you're explanation is clearer. Thank you!
this was so clear like you explained it better
6 years later and it still helps students like me
Wonderful explanation. Thank you!
You are such a dope bro,Thank you!
Thank you very much! Greetings from Italy!
I thought I had my answer at about :20 into the video
But I wanted to make sure so I watched until about 1:30 and my answer was confirmed
About 1:30 plus the 2 minutes searching google to find your video or "read" 40 pages of death to maybe find the same conclusion
I'll pick the 2 and a half minutes with you every time! thanks for this awesome video that cut the BS and got straight to business - no frills no BS new subscriber!
Thank you very much!
wow using this video i understood it completely
This is a great video. Thank you so much! God bless :)
Nice explanation in a short amount of time..!!Keep it up!!!Thank you so much :)
Watching your video Once again To revise topic one day before my End term❤️✔️
Thanku for lovely video
Hope you did great :)
@@EducateYourselfNow yes sir!! But actually this topic which i prepared for did nt come in exam!!
mannn .. that was so simple. Really helped me a lot.
Thanks so much! this is such a great video!
How would you do it if you can’t backtrack? You went from C to I and the C to F. If you had to continue from the last point you reached, how would you make it efficient?
Thank you so much!
Woah i was making a table but this is really easy the way you have done thanks alot.
A perfect explanation. Thanks :)
thank you :)
Ur the best other just use a small path so it makes this algorithm unclear but u use long path to show this. GOOD WORK!
I never comment on any video on youtube :-) but seriously u deserve a BINGO ..... THANK YOU
thank you!
You save my day man. Thanks... 🤩
Great explanation! Not the best video/audio quality, but definitely way better than most videos about this topic
Thanku for uploading this video because this is usefull for student like me.
Thanks for this video brother👍
Thank you for explaining this in a simple and efficient way! (This lesson was even better than my tutor's LOL)
Cool explanation
Great explanation, thanks!
at 5:17 we can not select AH not only because it would create a cycle but because A and H are already discovered before...so there is no need in examining those 2 edges at that moment
Great explanation though!! clear and to the point!!! love your videos on Kruskal's and Dijkstra as well!! :D
great example video
For the last move as you said we have choice between 9, 10 and 11 I think choosing the edge b-h was not a choice. it would have been a cycle.
yeah you are right, i missed that.
nice explanation. Thanks for sharing!!!!
Really helpful thanks!
Well done - the part about no cycles are not emphasized in other videos.
bless you, sir
You make it simple thank you
Perfect! Thanks
Keep up the good work buddy!
thanks you my guy!
Thanks a Lots....
It's help me to understand this topic.....
I am glad i was able to help :)
i still dont understand my lecturer give me question to find the shortet path from A to J
0:57s does arbitary vertex in the sense means any vertex of my choice ?
That is correct
Super helpful thanks man.
Thanks my hero
Nice Work man :)
I have a question b-c and a-h are basically ties because their distances are the same so why after choosing a-c did we not choose a-h ? But rather chose c-i ?
because we were at the node "c", and least costly edge from "c" is to "i"
Thanks. Total is 37
So is it safe to say, that this video finds the shortest solution one could travel to get to all locations? Meaning that every node must be reachable, but it's the most effecient way to reach all nodes? I'm strugling with this a bit because you could take the road from A to H and get there much faster that going way around.
Great explanation than my lecturer
Does it mean that we have to stop selecting edges until most edges that do not form a cycle will be selected? Then that would be the time the MST is already completed?
thank you so muchhh!!!
Do we determine a node to start? Or we just start?
you can start on any node which will still give you the same minimal possible weight st, however, it may result in a different mst.
+I don't understand. The route a h g f e has a spanning tree of 21, which seems the shortest to me. So the algorithm doesn't really work?
Its help me so much..thank you..
Btw, ur voice sound a little bit like harry style..
Thanks sir🤗
What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?
MST of the graph is a regular MST as well.
thank you!
thanks bro..it is helpful
thank you very much!
Thanks a lot!
my code chooses a-h instead of b-c, is this wrong or ???
Very Useful😆
Plz tell me the calculating time of prims algorithm which is implemented using SPQ (it is a special kind of priority queue)
That's a lot simpler way than it's taught in CS! Love it!
Thanks!
i need kruskal with prims and dikistras in single progragramm .. any help ???
best explanation XD
nice work.thank you so much.it has another alternative solution no?
Thanks! This is very helpful
thanks a lot man!!!
How it will help us to find a shortest path????...
but what if we selected the edge from a-->h instead of b-->c? And is it necessary that we do get the exact spanning tree when we select any vertex?
you would just continue the process, and what do you mean by that question?
Nice
At 5:46 how would edge 11 create a cycle?
at 5:01, why didn't you consider g to i because cost is 6 which is less than 7? i know it will create a loop but you did not even mention it? is there a reason or you just overlooked it by mistake ? thank you
good catch, yes I forgot to mention that 6 is the lowest but it will create a loop and that is the reason why I didn't choose it.
at 4:44 "number 7 seems to be the lowest out of all of them. pay attention we can't choose this as it will create a cycle and we can't have a cycle in prim's algorithm."
Because you keep track of previously visited vertices. At this point, I and G are already visited.
Good
Thanks :)
Very well❤
thank you
i dont understand, why should we take c-d that cost 17, when e-f cost 10 and doesnt cause any loop
Its a 7, not 17.
I have a question, why would i not be able to simply look at every node and assume that the cheapest path for that node was one that would be a part of the minimum spanning tree?
I am not sure if i understand the question properly
Thank you for the timely response, my goal isnt to find a minimum spanning tree but instead find the sum of the value of all paths that must be taken. so i was wondering if i could instead look at each node in the input independently and simply take the cheapest path for each node?
I see, yes you should be able to achieve that by looking at the input independently and taking the cheapest edge cost to its neighbor.
At 1:54 how to decide whether to choose (a and h) or (b and c)?
It doesn't matter, the MST is not unique
@@andreicirstea8517 Thanks! :)
why we take b to c not a to h???????\
you could, i mentioned that it doesn't matter which one you choose.
Tamil Student No, it’s still 37.
If you take a to h after a to b, then we will then take h to g, then g to f, then f to c, then c to i, then c to d, then d to e.
The total will be 4+8+1+2+4+2+7+9 = 37.
TY m8 :))))