Min Cost to Connect All Points (Prim's Algorithm to Create MST) - Leetcode 1584 - Graphs (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@chisomedoka5651]

I certainly know I'm going to come back 3-5 times before this sticks, great video once again

[@connoronfire]

Really great explanation! Thanks!

[@GarouNguyen]

Bro some those video you explain I don't unserstand but you are the best of the bests

[@kedarkulkarni9464]

Please don't stop making videos EVER! Even if you get less views or likes :( We don't want to lose a good teacher to the KZbin Algorithm Also, isn't the log n in the time complexity coming from sorting/heapifying within the heap?

[@GregHogg]

Haha thank you! And yes it is :)

[@GarouNguyen]

Bro why it work, I write it bht you have to hepify it so you can pop out smallest, if you not hepify a object variable into heap, it doesn't work

[@GarouNguyen]

Bro I don't understand anything huhu 😭

[@GregHogg]

This one is a little tricky