Minimum Spanning Tree #2: Prim Algorithm

Prim Algorithm is another algorithm that solves Minimum Spanning Tree problem. This video gives a graphical illustration of the algorithm and then a code demo.

[JoeSmith]

Thank you! Amazingly simple explanation. I have no idea why the textbook has to complicate things with weird and unnecessary symbols.

[nojoodothmanal-ghamdi]

Thank you very very very VERY much sir! all the videos were explaining the logical view of prim but none explained the code yet your explanation was a step by step explanation and was good! thank you

[bishololo]

you sir have saved me in my finals tomorrow :D thanks million times god bless 

[BoQianTheProgrammer]

I am glad you like my tutorials. I've thought about doing design patterns, but then I found there are quite some design patterns video on Youtube already. For example, the ones by Derek Banas are pretty good.

[mypowerlevelisover]

This is simplest explaination I have ever seen finally understood

[BoQianTheProgrammer]

Thanks for your frank comment. I was thinking along the same line. This probably will be my last video on Algorithm.

[rubiskelter]

Best explanation and includes pseudo-code. Very nice.

[rekiyanseto]

you have saved my Data Structures exam today.. god bless you

[UtubeJKZ]

big help to my Algorithms course! Helped me understand Prim and Kruskal algorithms!

[melissayang]

thanks a lot, after watching this video, I think I would never forget this algorithm.

[CookiesfromHell]

Great and simple explanation. Helped this dummy out a ton!

[renesje]

Thank you so much, this really helps me a lot for my exam tomorrow

[ravravindersingh]

Very well Explained. Keep Up the good work. Thank you.

[ssam]

Hi Bo,

I have listened all you C++ posting and these are really nice. I got lots my my doubt in C++ clarified from your posting. Would you please post some of the tutorials on design patterns using C++ and when to use which design pattern.

Thanks,
Samaresh

[ehteshmohd]

Hi,
I am also a great fan of your tutorials. They are simple and rich in content. I would also love to see some videos on design partters using c++ .

Thank you.
Ehtesham

[marisagermis]

HI :D Great video! it was super helpful! But i have a question. How can the number of edges in a sparse Adjacentmatrix be less than the number of nodes? If we take a tree, (smallest connected graph, and we need connectivity for prim) than the number of edges are V-1, so adjacent(u) would be in O(V) and therefore the whole algorithm for sparse matrices would be O(N^3)? or not?

[mkay]

it is best explanation of pseudocode ..

[nasrulkarimsarker]

Thank you very much...This is really helpful...Keep up the good work :D

[nitskrishna]

Many thanks sir, very nicely explained...

[BGivo]

Anyone know how to tweak this so that it prints the "weight" of each edge as well?