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

Not clear...

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

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

thanks
Was a great help!

How can you be in computer science and not figure out the sound

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

why for(count 0 to V-1)..

Struggled a lot to understand what he was trying to explain. I think you need to work on the explanation with an understandable pronounciation and voice to get rid of 20% of dislikes.

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

not a good video as per gfg standard.

I checked my earphone twice before checking comment section lol😆

It's like he is reading a paragraph, bad representation.

Method to teaching was really complex.

I watched the video twice, once with right earplug in right ear and next with right plug in left ear.

Kitna bakwas samjhaya. Not good

One of the worst videos they have released, terrible production, bad explanation, overcomplicated code. Expected more from GfG. Would recommend you to learn elsewhere for this topic.

what does "min_index= -1" mean at the beginning of the code?

Really like your way of teaching. I have also made video on this topic. Please go through it too.

expected gig to have better production

same as Dijkstra's right?

thank god for the one who made the subs

very nice explanation.. thank you

Why the loop was running V-1 times?
In primsMst function!!

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.

this is dijkstra !!

what if, we got an directed graph??
like,

0 is the source and edge are,

0 1 10
1 2 2
2 3 3
3 1 4

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

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

Great work GeekforGeeks.. I want to suggest that in your subsequent video try to create a small space where you can type your words as you teach.. Though you try to make it transparent, it was still a distraction.. Well done bro and keep the good job going

awesome explanation ...thanks for the code

good thing the right part of my headphones wasnt totally dead

dude u even dont know ELOGV > V^2(becz E=V^2)

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

The best!

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

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.

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

Great video sir...

v2 and v7 mai se agar v1 loge toh answer 39 aayega.

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

I don't understand the video

Worst explaination didnt expected this from geeks for geeks

How do we apply the prims algorithm if the vertex are not digits but are alphabets??

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

My right ear gained a lot of knowledge today. The left is still a dumb piece of cartilage.

How can we choose vertex to start from?

bro work on the audio part of video...

P O O I N L O O

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