Prim's Algorithm: Minimal Spanning Tree

Prim's Algorithm is used to find a minimal spanning tree of a weighted graph. This videos shows you how to do it!

[@abhichakladar5279]

This was so confusing the way my prof explained in class, yet the way you explained it in this video I got it in 2 minutes, and now I have that part of the final down. Thank you.

[@PanneerYuvaraja]

I have kept watching many videos on youtube , but this was the best !! Keep doing videos for all topics on datastructures Sir !! Keep up the good work ! Tomorrow is my semester and I am benefited very much by your video !

[@maryamwahab]

cooool ........i dont even have to read this topic !!! it just got imprinted in my mind from ur lecture !!!!!!! thanks :)

[@DeepIntoMyThoughts]

Great video! Always easier to understand when you get it visualized like this.

[@starcalibre]

seriously the best algorithms videos on youtube. thanks for posting these.

[@david_artist]

This video explains the algorithm very well!

[@justaplanet]

I have a test in 50 minutes and was hella stressed cause this problem was giving me hella trouble. Thank you so much.

[@and1fer]

very helpful, thank you.

[@party_boy69]

Very easy to understand explanation. This should help me with my assignment question which is hard to grasp without mst knowledge. thank you.

[@ChelinTutorials]

great teacher, great work! Thanks for the video. cheers from Argentina!

[@knightjia97]

best explanation of prims algorithm by far

[@motorheadbanger90]

good enough for me. better than lecture...and the man leading my lecture is the nephew of Kruskal who founded Kruskals algorithm, Clyde.

[@alehunter15]

god bless u dude

[@mohamedabdul633]

The best explanation ever!

[@nimamaleki1595]

Thanks buddy! Short and sweet! Useful.

[@CeretPenyok]

Whoa. Thank you so much. I was looking for some from Google and get many forum and blog, but I still can't understand the method, and then I found this video. Thank you sir. :) You really helped me out. :D

[@Allin-ri6tx]

very much help full and easiest way to explain

[@yanksrock1000]

Great simple explanation!

[@umphgoodness]

Awesome, thank you! This really helped reinforce the concept in my head.

[@TheNapolyon]

5 min. youtube video is better than a 50 min lecture :))

[@spacebar9615]

very good explaining and good example thank you!

[@derrickmink]

you are such a great teacher, please do more videos

[@Beastofcookies]

TEACH ME MASTER! No but seriously thanks. Your video was the first explanation I looked at and it made perfect sense. :)

[@anthonydifede4510]

Great video, easy to follow. Helped me in discrete math.

[@felipegassen4070]

Great explanation!! Thanks for your help Barry!

[@Lnmul]

Much easier to understand than how my professor taught it. Thanks!

[@GoodNewsForStrangers]

You're awesome Mr Brown!

[@rebecCATz]

Thanks for the helpful explanations! Your videos are great!

[@theamjolnir9641]

Beautifully explained, thank you!

[@lucky2kay]

can be used to work out the cheapest or the quickest way to touch all the vertices, depending on what the numerical values represent

Great! Thanks for the clear explanation.

[@kornklown420]

Dude! I think I was in one of your classes (quite a few years back) at Sierra College! Great job on the video! Unfortunately the computer science world is saturated with videos of terrible quality that are difficult to understand. You made the concept of a spanning tree very simple to understand, thank you!

[@AnanyaKirti]

really nice explanation.

[@mehdibenguerrah5445]

Thank you ! Very good explanation

[@alexstapf]

Great explanation! NOW I understood it. Thank you.

[@AbdullaFaraz]

that was really easy to understand. thanks so much

[@omercak2746]

Just awesome! Thank you

[@MuchKnowledge]

Great video, thanks!

[@nicchang1234]

The video is great. Thank you so much

[@wellingtonsouzamarques222]

Great class!!

[@4751ludo]

Thank you really well explained

[@TehFingergunz]

great video, thank you!

[@AzRAELGoDlIkE]

Thank you ! This video explains it perfectly!

[@ssmage]

Great video!

[@ramazangul1789]

Thank you million times

[@yasmin_jsmn]

very simple explanation ,, keep going

[@jamesvega7258]

HI. Thanks for the guide man. It was very useful

[@mariusc6882]

Thank you! Very helpful!

[@justodiaz1858]

For MST, I believe you can add a small constant to all edges to break ties.

[@codemurp3244]

+Justo Diaz Wait...can you please explain how that works? Wouldn't the edges still end up tying because you're adding the same constant? Sorry

[@justodiaz1858]

+codeMurp :3 I should have said, add different extremely small numbers to each edge. This keeps edges that were originally distinct still distinct, but for edges that were originally the same are now distinct. You could add different fractional amounts by adding to each edge a fraction in increasing order. So take your first edge add .001, take the next edge add .002 etc. If fractions scare you, multiply all edges by 1000, then take your first edge and add 1, take the second and add 2, etc. This is assuming you don't have more than 1000 edges. If you do, than make your additions even smaller. The point is to make sure the additions are so small that they keep the original order, but still break ties.

[@vijaygaonkar7020]

I agree with Beastofcookies and Derrick Mink, please do more videos. Thanks a lot!

[@nnzhdnv]

wow thanks, you explained this very very well! got it the first time round :)

[@Vigi]

Good video! :)

[@archiemorley1601]

you are a boss, helped me out xx

[@rianzamanx]

Thank you very much...

[@TheYsrawat]

Thanks for the nice explanation. At 2:50 if we have chosen G-A which has same weight as H-F, then the result would have been different and it would not result in a minimal spanning tree. Please let me know in case I am missing something.

[@jms2829]

Very helpful. Thanks heaps

[@LuaneCarolineAquinoCavalcanti]

thanks a lot, great video btw

[@arvindk2568]

Great video. Thx a lot

[@willclegg1]

Could have definitely done with you as my uni lecturer this year!

[@AnkitSharma-tj4ub]

Thanks a lot! A really helpful video :)

[@LeonardoRinaldiYautja]

Thank you very much, that helped me a lot!

[@BananaCold]

This is god damn clear! Really appreciate this great video!

[@SurbhiShah16]

amazing video!!! thanks a lot!

[@cameraGHOST]

Thank you so much!

[@otuyakbayev]

really helpful video! thank you a lot! appreciate this!

[@PMD90]

it helps me so much thank you

[@nickold4499]

Thank you!

[@sleekygee1]

great tutorials ;)

[@tahaabdullah4278]

Great video, really helped me out. But I was wondering, what's the difference between Prim's algorithm and Dijkstra's algorithm. As I understand it, both figure out the minimum spanning trees for a given graph in about the same way.

[@atlas6030]

I thought this was Khan Academy! But anyways thank you :)

[@henry14835]

thanks, your video is very nice

[@rubalrai1]

great video..👍

[@samarth_blak]

Its better dan my lecturer's lecture... That person took 1 hour to explain this..!!!!

[@tahamagdy4932]

Thank you dear

[@felfaj]

Thank you very useful

[@kshitizadhikari3855]

awesome vid thnks !! :)

[@MWARIS1]

Thank you sooo much you explained really well, Thank you :)

[@riffstofly]

This is great. thanks

[@aleksandrakapa]

excellent!!!

[@rogisolorzano6691]

well done

[@rohitmanocha4167]

thanks a lot SIR!!!

[@RatusMax]

Lol had to write a code for this, but i didn't understand WHERE those weight numbers came from until i watched this. Thanks

[@masbro1901]

thank you sir

[@dinosaur5009]

THANK YOU!

[@HollyVanHart]

💖 Thanks for this! ✨ 😻 😍

[@ayush11iitkgp]

thank you Sir...really helpfull..!! :)

[@Graskian]

Amazing

[@darinebouzar3575]

very much clear, even a stupid will can understand, thx so much professor

[@TheRoxas13th]

Nice! But i still confuse what this minimum spanning tree used for.

[@paulmaurin1149]

thank you

[@bankarsatyajeet]

thanks a lot sir...........

[@SolarMar]

Thank you!!!!!!

[@NoCodeine]

cheers barry mate

[@cpandit803]

Super thanks :)

[@SameedUsmani47]

awesome vedio

[@TheKillx0ne]

legend. thanks a lot :)

[@denebgarza]

You sound like Salman Khan.

almost

[@jasminejia8540]

agree!

[@mickyor1107]

thanks :D time to code for me xD this really helped me a lot :)

[@AhmedThaking]

@benja303 I was thinking the same thing. But it is not Sal from Khans Academy

[@alicetra0109]

Bro thank you so much