Prim's Algorithm: Minimal Spanning Tree

Prim's Algorithm is used to find a minimal spanning tree of a weighted graph. This videos shows you how to do it!

[abhichakladar]

This was so confusing the way my prof explained in class, yet the way you explained it in this video I got it in 2 minutes, and now I have that part of the final down. Thank you.

[justaplanet]

I have a test in 50 minutes and was hella stressed cause this problem was giving me hella trouble. Thank you so much.

[PanneerYuvaraja]

I have kept watching many videos on youtube, but this was the best !!
Keep doing videos for all topics on datastructures Sir !! Keep up the good work !
Tomorrow is my semester and I am benefited very much by your video !

[motorheadbanger]

good enough for me. better than lecture...and the man leading my lecture is the nephew of Kruskal who founded Kruskals algorithm, Clyde.

[starcalibre]

seriously the best algorithms videos on youtube. thanks for posting these.

[CeretPenyok]

Whoa. Thank you so much.
I was looking for some from Google and get many forum and blog, but I still can't understand the method, and then I found this video. Thank you sir. :)
You really helped me out. :D

[DeepIntoMyThoughts]

Great video! Always easier to understand when you get it visualized like this.

[party_boy]

Very easy to understand explanation. This should help me with my assignment question which is hard to grasp without mst knowledge. thank you.

[kornklown]

Dude! I think I was in one of your classes (quite a few years back) at Sierra College! Great job on the video! Unfortunately the computer science world is saturated with videos of terrible quality that are difficult to understand. You made the concept of a spanning tree very simple to understand, thank you!

[maryamwahab]

cooool dont even have to read this topic !!! it just got imprinted in my mind from ur lecture thanks :)

[knightjia]

best explanation of prims algorithm by far

[Beastofcookies]

TEACH ME MASTER! No but seriously thanks. Your video was the first explanation I looked at and it made perfect sense. :)

[ChelinTutorials]

great teacher, great work!
Thanks for the video.
cheers from Argentina!

[luckykay]

can be used to work out the cheapest or the quickest way to touch all the vertices, depending on what the numerical values represent

[derrickmink]

you are such a great teacher, please do more videos

[david_artist]

This video explains the algorithm very well!

[umphgoodness]

Awesome, thank you! This really helped reinforce the concept in my head.

[SerTony]

Great video, easy to follow. Helped me in discrete math.

[felipegassen]

Great explanation!! Thanks for your help Barry!

[rebecCATz]

Thanks for the helpful explanations! Your videos are great!