Prim's Algorithm: Minimal Spanning Tree

[@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 !

[@justaplanet]

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

[@motorheadbanger90]

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

[@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

[@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!

[@starcalibre]

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

[@DeepIntoMyThoughts]

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

[@knightjia97]

best explanation of prims algorithm by far

[@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.

[@maryamwahab]

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

[@ChelinTutorials]

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

[@nimamaleki1595]

Thanks buddy! Short and sweet! Useful.

[@rebecCATz]

Thanks for the helpful explanations! Your videos are great!

[@Beastofcookies]

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

[@derrickmink]

you are such a great teacher, please do more videos

[@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

[@and1fer]

very helpful, thank you.

[@david_artist]

This video explains the algorithm very well!

[@SerTony16]

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

[@umphgoodness]

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

[@felipegassen4070]

Great explanation!! Thanks for your help Barry!

[@alehunter15]

god bless u dude

[@devkodar303]

thank u for explaining this much easier!

[@mohamedabdul633]

The best explanation ever!

[@TheNapolyon]

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

[@AbdullaFaraz]

that was really easy to understand. thanks so much

[@Lnmul]

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

[@yanksrock1000]

Great simple explanation!

[@theamjolnir9641]

Beautifully explained, thank you!

[@Allin-ri6tx]

very much help full and easiest way to explain

[@spacebar9615]

very good explaining and good example thank you!

[@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.

Great! Thanks for the clear explanation.

[@mehdibenguerrah5445]

Thank you ! Very good explanation

[@atlas6030]

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

[@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.

[@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.

[@alexstapf]

Great explanation! NOW I understood it. Thank you.

[@AnanyaKirti]

really nice explanation.

[@nicchang1234]

The video is great. Thank you so much

[@jamesvega7258]

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

[@AzRAELGoDlIkE]

Thank you ! This video explains it perfectly!

[@Vigi]

Good video! :)

[@vijaygaonkar7020]

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

[@shrikantbang1692]

Great video !

[@willclegg1]

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

[@MuchKnowledge]

Great video, thanks!

[@nnzhdnv]

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

[@omercak2746]

Just awesome! Thank you

[@archiemorley1601]

you are a boss, helped me out xx

[@4751ludo]

Thank you really well explained

[@yasmin_jsmn]

very simple explanation ,, keep going

[@TehFingergunz]

great video, thank you!

[@wellingtonsouzamarques222]

Great class!!

[@LeonardoRinaldiYautja]

Thank you very much, that helped me a lot!

[@rianzamanx]

Thank you very much...

[@ramazangul1789]

Thank you million times

[@LuaneCarolineAquinoCavalcanti]

thanks a lot, great video btw

[@jms2829]

Very helpful. Thanks heaps

[@arvindk2568]

Great video. Thx a lot

[@hardikanand6153]

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

[@AbhishekGhosh1805]

Would you not pick H going to E directly (weight: 4), instead of going from H => F => E =>Total Weight: 7 ?

[@thetubeingtubster93]

great presentation. my professor says to start with the one with the most degrees. Does it matter where to start?

[@otuyakbayev]

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

[@igedemahendradarmawiguna9558]

I am wondering, what software do you use for explaining this... seem interesting...

[@AnkitSharma-tj4ub]

Thanks a lot! A really helpful video :)

[@rubalrai1]

great video..👍

[@sleekygee1]

great tutorials ;)

[@TheRoxas13th]

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

[@cameraGHOST]

Thank you so much!

[@AhmedThaking]

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

[@SurbhiShah16]

amazing video!!! thanks a lot!

[@queenofunderland]

hi mr. brown, when we write Java Codes regarding the insertion of an edge of min. weight AB, then in the "main menu" method , we can write: for (i=0;i< G.length; i ++){ if (AdjacentMatrix G[i] == 1) col[i]= true; enter the edge AB to the list of visited vertices } , right?

[@PMD90]

it helps me so much thank you

[@henry14835]

thanks, your video is very nice

[@siyuanliu4581]

The video is great! BTW, how do you draw all those things? What software are you using?

[@profbbrown]

+Shawn Liu At the time I was using a Wacom Cintiq tablet with Autodesk's Sketchbook Express. If I were to re-make the video today, I'd use an iPad with GoodNotes.

[@kshitizadhikari3855]

awesome vid thnks !! :)

[@BananaCold]

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

[@nickold4499]

Thank you!

[@engmfouda]

How can we prove the correctness and the termination of this algorithm ?

[@HollyVanHart]

💖 Thanks for this! ✨ 😻 😍

[@WernAncheta]

Hi Barry, thanks a lot for this video. You mentioned at the later part of the video that we would always end up with the minimal weight of 22, but when I tried solving it I got 24 instead. Am I doing something wrong or is it normal to get other values aside from 22.

[@riffninja]

This is great. thanks

[@hanselgunawan1151]

GOD BLESS YOU!

[@rohitmanocha4167]

thanks a lot SIR!!!

[@steeeeeven11]

Thank you, very helpful!

[@tahamagdy4932]

Thank you dear

[@samarth_blak]

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

[@MWARIS1]

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

[@Angel-y5u8b]

What if you are given some random dots with an (x, y) location, any idea of how to create the weighted graph to then use this algorithm? I thought about connecting everything to everything with a weight to create the graph en then use the algorithm but I'm thinking it would make it way slower, any thoughts/suggestions?

[@felfaj]

Thank you very useful

[@mickyor1107]

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

[@ayush11iitkgp]

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

[@thetubeingtubster93]

and fir the maximum would you do the same thing but look for the maximum instead ?

[@fraxmans]

I know people won't add the edge between G and F, but how to make computer to avoid adding it?

[@aleksandrakapa]

excellent!!!

[@masbro1901]

thank you sir

[@education5393]

if you chose to go to A from G when you had the tie the MSP would be wrong, there has to be some balancing you are omitting

[@NoCodeine]

cheers barry mate