Prim's Minimum Spanning Tree Algorithm | Graph Theory 

Thanks for making it super easy to understand. I am super lucky that I found your channel among the pile.

Do you know what the scariest think in the world is >??

Thank you so much!!! learning algorithms from a book in the university is really hard and your videos are super helpful!!

I'm so glad I found your channel! Thank you so much for your hard work!

This explanation is so good! Understanding this algorithm is already hard, and coding the solution up is difficult on another level. I tried reading the code on different websites and in different videos, and I had a hard time understanding it. However, you example, visualization and clean code made me understand everything in less than 20 minutes. Thank you so much!!!

How will the complexity be E log E ? Is it for Adj list representation because for a matrix representation I am selecting a vertex then looping through all other vertices to add them in the queue, if an edge exists at all so I am doing the work V times right? So the complexity will still be O(V^2 )

Very Nice Bro. Keep on making videos on other topics. Your animations are really usefull.

I have missed these videos so much. Awesome explanation.

3:27 to be more precise, the two versions (lazy and eager) have the same complexity of O(E*log V) because log(E) = O(log(V)). This is because E < V^2, so log(E) < log(V^2) = 2*log(V) = O(log V). In big-O notation, it never really makes sense to use log(E) instead of log(V) for graph algorithms.

This helped me a lot. Many thanks to you, my friend

why am i hearing "oh hell nah" in the background 5:20

2:12 when i started doing it, it looked kinda sus bro hahahaha almost a nazi sign

brilliant explanation = thank you so much

Hands down best channel for graph algorithms resource on youtube. Thanks mate

Hey awsome video but I don't understand what happens at 8:41 you say its stale because (2,1,3) but how did you get that should'n it have been (1,2,3) because you were starting from node 1?

This deserves more views.

After watching people on the internet unnecessarily complicating this beautiful algorithm. I'm here!

Thanks williams

I understand MST in 10 minutes while I spent long time in university book.

thank you so much !! Really helpful !

You're so good that i recommend your channel to every SWE i meet.

Is each minimum-heavy spanning tree of N also a minimum spanning tree of N vertices!

Better explanation than Leetcode premium, thanks a lot!

thank for your video ,it help me learn Tree algorithm !!!

This helped me a lot! Thanks!

Simple and helpful ✌🏻

It's very helpful. Thanks

Thanks William! Understood the algo :)

Thank you lots!!

what does to poll mean? we just choose a node randomly?

Beautiful! :)

Thank you @WilliamFiset for such an amazing explanation, I wish you were teaching while I was still in college.

great job!!

pls explain the time and space complexity as well

Why choose vertex which is connected by minimum adge? it works even if we traverse and choose vertex from an ordinary queue(not priority queue) Becoz the goal is to connect vertex with minimum edge only and we can archive this even by choosing elements randomly

Clean and excellent explanation Elegant & Beautiful

damn I thought 2:14 was about to be a swastika

Excellent Explanation. It was crystal clear. I got everything in one go.

where in the code do we select the cheapest edge from the PQ?

U'r the best man u'r the best

Thanks for the explanation!

Well done!

very helpful!

Thank you, Sir.

Yes, Prims is nice.

For someone in doubt like myself, wondering which node to start from to put into priorityqueue, you can start with nay node and will still get the same MINIMUM SPANNING TREE (which by definition contains all nodes joined via the minimum weighted edges)

One minor thing: it seems mstEdges[0] stays null.