Prim's Algorithm: Minimum Spanning Tree (MST) 

This is the most clear explanation I've seen. It contemplates everything, Thank you!!

saved me during finals man absolute stud

awesome video man, was struggling at first to get the concept and you helped nail it down for me. thank you!

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

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.

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.

Thanks a million Sir 👍👌🔥 4 years before but hasn't lost the charm 👍

Thank you so much. I was baffled with so many videos.But yours tutorial took my concepts on the track.

best explanation for prims algo that I've found

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

This is the most clear explanation I've seen. Thank you so so so much

Great explanation! Much better than my book and I finally understand it

this is an excellent explanation. This will definitely help me for my data structures exam

Genuinely clear explanation. Thank you!

Your video helps me a lot. Thank you for your great work!

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!

Made me understand it in minutes!! Thank you!

Simple and easy. Great job dude!

Thanks a lot ....after a lot of search I got this helpful explanation.

Thanks, you confirmed that my professor messed up in grading our homework, thanks

Brilliant! Thank you for your clear explanation.

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

Watching your video Once again To revise topic one day before my End term❤️✔️ Thanku for lovely video

No wonder they say it's a surprisingly easy algorithm! And yet quite difficult to teach for some

Great explanation! Not the best video/audio quality, but definitely way better than most videos about this topic

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 never comment on any video on youtube :-) but seriously u deserve a BINGO ..... 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!

You are such a dope bro,Thank you!

Wonderful explanation. Thank you!

You save my day man. Thanks... 🤩

Nice explanation in a short amount of time..!!Keep it up!!!Thank you so much :)

Thank you very much! Greetings from Italy!

mannn .. that was so simple. Really helped me a lot.

wow using this video i understood it completely

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)

Thank you so much!

Thanks so much! this is such a great video!

This is a great video. Thank you so much! God bless :)

Thanku for uploading this video because this is usefull for student like me.

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?

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.

great example video

A perfect explanation. Thanks :)

Woah i was making a table but this is really easy the way you have done thanks alot.

Well done - the part about no cycles are not emphasized in other videos.

Cool explanation

Thanks my hero

Perfect! Thanks

Great explanation, thanks!

That's a lot simpler way than it's taught in CS! Love it!

Keep up the good work buddy!

Really helpful thanks!

nice explanation. Thanks for sharing!!!!

Nice Work man :)

bless you, sir

thank you so muchhh!!!

You make it simple thank you

Its help me so much..thank you.. Btw, ur voice sound a little bit like harry style..

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!

Super helpful thanks man.

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.

best explanation XD

0:57s does arbitary vertex in the sense means any vertex of my choice ?

+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?

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 ?

Thanks a Lots.... It's help me to understand this topic.....

Thanks. Total is 37

Great explanation than my lecturer

Thanks!

Thanks sir🤗

Thanks a lot!

Thanks! This is very helpful

Very Useful😆

i need kruskal with prims and dikistras in single progragramm .. any help ???

thanks a lot man!!!

Thanks :)

Plz tell me the calculating time of prims algorithm which is implemented using SPQ (it is a special kind of priority queue)

nice work.thank you so much.it has another alternative solution no?

Nice

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?

thanks bro..it is helpful

TY m8 :))))

Color the visited nodes or manage list to detect cycle !!! Dont take edge with 2 visited nodes...

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

Do we determine a node to start? Or we just start?

i still dont understand my lecturer give me question to find the shortet path from A to J

Great 😍

Very well❤

Good

my code chooses a-h instead of b-c, is this wrong or ???

How it will help us to find a shortest path????...

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?

Thx bro

bravoo...!!!

At 5:46 how would edge 11 create a cycle?