Prim's Algorithm: Minimum Spanning Tree (MST)

Short example of Prim's Algorithm, graph is from "Cormen" book.

[@nahux]

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

[@EducateYourselfNow]

thank you so much!

[@jacoblopez6365]

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.

[@x33rak]

@@jacoblopez6365 was pretty clear to me to be honest

[@thescoobiestdoo2642]

saved me during finals man absolute stud

[@SaumyaSharma007]

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

[@derekharrison8434]

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.

[@MyBajskorven123]

thank you, just finished coding and my algorithm chooses a-h first

[@ashleyarmenta158]

best explanation for prims algo that I've found

[@DB99SIL]

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

[@chrisklecker]

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.

[@EducateYourselfNow]

that is true, i should have. Maybe i ll upload another one

[@kimayapanash8998]

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

[@EducateYourselfNow]

i am glad i can help :) thank you so much for the sub!

[@kimayapanash8998]

love you from the bottom of my heart. now i can make all my friends beg me to help them HAHAHAHAHA

[@EducateYourselfNow]

lol unless they see this video

[@kavereon]

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

[@aishwaryaratnam154]

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

[@EducateYourselfNow]

thank you very much! i am glad my videos are helpful

[@whatamiwatching2183]

Made me understand it in minutes!! Thank you!

[@cansngok8794]

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

[@tanthokg]

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

[@williamgreen5642]

Genuinely clear explanation. Thank you!

[@personaliTia]

Brilliant! Thank you for your clear explanation.

[@siddsundar2464]

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

[@EducateYourselfNow]

thank you and good luck

[@Psydle_]

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

[@EducateYourselfNow]

Get as many points as possible, they add up at the end.

[@abdulrahmankerim2377]

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

[@mahernoureldine6216]

Simple and easy. Great job dude!

[@EducateYourselfNow]

thank you

[@mohammadgh5768]

6 years later and it still helps students like me

[@jayraldempino8907]

This totally helped me, you're explanation is clearer. Thank you!

[@MyFictionalChaos]

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

[@Avex.]

this was so clear like you explained it better

[@tin5180]

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

[@EducateYourselfNow]

i am glad i could help, thank you for the comment!

[@dahaliahowell1516]

Wonderful explanation. Thank you!

[@warrenzingwena2075]

You are such a dope bro,Thank you!

[@SuppaMan]

Thank you very much! Greetings from Italy!

[@nhlvan]

wow using this video i understood it completely

[@VARUN-gn5kq]

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

[@EducateYourselfNow]

Hope you did great :)

[@VARUN-gn5kq]

@@EducateYourselfNow yes sir!! But actually this topic which i prepared for did nt come in exam!!

[@IAmJohnThePooMaster]

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!

[@EducateYourselfNow]

Thank you very much!

[@aashayzanpure4248]

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

[@Ezequielc23]

Thanks so much! this is such a great video!

[@sandipanmajhi2770]

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

[@JamesBrodski]

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

[@rajithaprasad-t8i]

You save my day man. Thanks... 🤩

[@digvijaybhardwaj2515]

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

[@osamasajid1997]

I never comment on any video on youtube :-) but seriously u deserve a BINGO ..... THANK YOU

[@EducateYourselfNow]

thank you!

[@Dong_Sahapol]

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!

[@morningwood1787]

Thank you so much!

[@sulemanali4006]

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

[@Mugdha25g]

A perfect explanation. Thanks :)

[@EducateYourselfNow]

thank you :)

[@biaoalex2018]

Thank you for explaining this in a simple and efficient way! (This lesson was even better than my tutor's LOL)

[@IZZY3201]

Thanks for this video brother👍

[@mads7401]

Great explanation, thanks!

[@mr.anonymous6098]

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

[@chinaguy101]

great example video

[@sayaksam]

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.

[@EducateYourselfNow]

yeah you are right, i missed that.

[@howardhuang3959]

nice explanation. Thanks for sharing!!!!

[@arnarfreyrkristinsson8650]

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

[@parneetkaur2588]

Cool explanation

[@jmmifsud1]

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

[@WebContrive]

Really helpful thanks!

[@GuitarBill13]

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

[@rahafalmotery3202]

You make it simple thank you

[@solarielee7540]

Perfect! Thanks

[@Rewdy]

bless you, sir

[@swedishfish3555]

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?

[@Lipitao]

Thanks my hero

[@danielkim2174]

Keep up the good work buddy!

[@EducateYourselfNow]

thanks you my guy!

[@shafiurrahman5166]

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

[@EducateYourselfNow]

I am glad i was able to help :)

[@sanket_valani]

Nice Work man :)

[@SpykeHacks]

Super helpful thanks man.

[@silentxmoon867]

thank you so muchhh!!!

[@krishna9438]

Thanks! This is very helpful

[@rishipl3559]

Great explanation than my lecturer

[@triciadawn]

thank you!

[@anoynimoushunter7666]

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

[@lameeshawash7496]

Thanks a lot!

[@moazzamjan9630]

Thanks sir🤗

[@micimaos]

Thanks!

[@sarojsah4173]

thanks bro..it is helpful

[@EducateYourselfNow]

thank you very much!

[@senuriyasara8990]

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

[@zyanlim9211]

best explanation XD

[@dailydose7680]

Very Useful😆

[@whox8829]

TY m8 :))))

[@SY-uh8vs]

Thanks. Total is 37

[@sumanthmylar3846]

thanks a lot man!!!

[@dramassi]

Nice

[@GPTOMG]

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

[@mandisaxulu4695]

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 ?

[@EducateYourselfNow]

because we were at the node "c", and least costly edge from "c" is to "i"

[@jacoblopez6365]

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.

[@WahranRai]

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

[@kevinapack]

Thanks :)

[@halcy6422]

i dont understand, why should we take c-d that cost 17, when e-f cost 10 and doesnt cause any loop

[@h-emporio4540]

Its a 7, not 17.

[@AroundBDVillage]

Good

[@reanmanuelclementir5569]

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?

[@thomassegaert]

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

[@saranshsaha6348]

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

[@noahtownsend3962]

That is correct

[@TJVideos]

Very well❤

[@EducateYourselfNow]

thank you

[@linguafranca7834]

Great 😍

[@MyBajskorven123]

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

[@AliAhmad3810.]

You are wrong in prim's we select least cost vertex So we select h to g vertex instead of a to b

[@murselbaspnar1919]

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

[@EducateYourselfNow]

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.

[@hardikanand6153]

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

[@zoriiginalx7544]

MST of the graph is a regular MST as well.

[@umarchohangujjar233]

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

[@mikeey]

Thx bro

[@derdev6574]

thank you

[@cagkandemir1801]

cheers lad

[@saranshsaha6348]

bravoo...!!!

[@Github_tech_with_ty]

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