Prim's Algorithm for MST(with Code Walkthrough) | GeeksforGeeks

preview_player
Показать описание


This video is contributed by Harshit Verma

Please Like, Comment and Share the Video among your friends.

Also, Subscribe if you haven't already! :)
Рекомендации по теме
Комментарии
Автор

My left ear didn't get it but right ear understand it..great explanation

vinaypatel
Автор

Win+U > audio > Turn on mono audio
Edit: turn it off afterward or you won't have directional audio

rishikaushik
Автор

i'm not sure you still read comments after 5 years since you uploaded but you kinda saved my life. i have to submit a project before midnight tomorrow and i had to implement a priority queue as well and i was getting crazy because i couldn't understand what i was doing wrong (it was the update of the queue of course) <3

JarOfHeat
Автор

Now my right half of brain is smarter than the left half. Thank you.

makealemonade
Автор

Thanks for making this vedio. The people who are complaining about your audio are the one who actually came here to focus on an unimportant thing.

reassume
Автор

i had to watch the video a second time because my left ear got mad at me saying that I let the right one learn but not him

alieser
Автор

I didn't know that there is a video that explains the algorithm of the site. Now I finally understand why the fucking key array is needed in the code. Thanks a lot

sdd-sj
Автор

first time didn't get any geekforgeeks explanation. T.T my head is hurting now.

uesugikenshin
Автор

what will we do when we look for the vertex that is not included in the mst set, and we see that there is a minimum edge which is also making a cycle then where we have to move from that node if we are going to exclude that edge and when we get two edges left from that node how to choose correct edge if I have many ways to get to those two vertices
for example: in video, I am on V6 as I have chosen V2 from V1, now At this position I am confused should I go to V5 first or V2 to go to V3 through the minimum edge

bysavvyway
Автор

At 3:48 when the key of both 2 and 7 are the same what if we choose vertex 2. A different st is formed.
Is that correct.

siddharth_cse
Автор

How do you blow into the microphone, when using a robot voice

anuprakashsharma
Автор

How can we choose vertex to start from?

vedrankarajlic
Автор

I think the code is not correct. The the vertice 3 will never get a parent. It should renew parent list just after it has refreshed mstSet, rather than in the second for loop.

bobplan
Автор

awesome explanation ...thanks for the code

rugvedbongale
Автор

Excellent ..
Marvellous ... Clears concept...

raghavgupta
Автор

Best Explanation... 🌟🌟🌟Just speak a little slow 😅🙏

vinaygurjar
Автор

At 7:09 who checked their mobile phones?

anjaneysharma
Автор

What is the time complexity of implementing this algorithm with an adjacency list and priority_queue?

elliotliu
Автор

why is the first for loop iterating from 0 to V-1?

vishmapdas
Автор

Throughout your explanation you have never mentioned how the parent array is used.

thetruereality