Finding the Minimal Spanning Tree using Prim's Algorithm

This video introduces you to the implementation of Prim's Algorithm to find the minimal spanning tree of a graph. The implementation is demonstrated on a matrix representation of the graph..

[JosephGrech]

Miss Daly you have some of the best videos about algorithms online.

[gearoidmurphy]

Thank you for this informative tutorial, explicitly going through each step of the algorithm in a graphical illustration is an excellent way to illustrate the inner workings.

[saeedkhan]

wow you are awesome i was confused regarding the columns . Now i am no longer confused and your teaching method is easy and understandable

[Mahram]

Using the matrix diff to compute the MST was a good idea, incase if it is too complicated tree. Thanks for the idea and the explanations.

[fiona]

Thanks very much for your clear and detailed explanation and teaching, Now I am clear and have much confidence in my exam ! Thankyou !

[johndavidkromkowski]

Nicely done. I could have used this in 2008 when writing this article: Kromkowski, John David. "Still Unmelted after All These Years", in Annual Editions, Race and Ethnic Relations, 17/e (2009 McGraw Hill) (Using minimum spanning tree as method of demographic analysis of ethnic diversity across the United States). Instead, I reinvented wheel with a method I now realize is "Boruvka’s". I am now writing a new paper which will have a lot more nodes so I am reexamining methods.

[srkrohit]

simply awesome video....Thank you :-)

Keep posting, it helps so much.... Really appreciate your work.

[TheEternalMoonlight]

Thanks so much!  Our textbook does a poor job of explaining, but you helped me understand it.

[MrMatz]

Thank you very much for this video. It helped me a lot.

[stokes]

this was a great video, your voice is lovely.

[cageali]

Very good explanation. Thank you very much.

[mbaymahubert]

that was a great explanation, thanks
 

[komparez]

Thanks a lot for the video. It helped me a lot.

[daoooome]

thank you very very very much
you save my life :)
god bless you

[kisuna]

its really helpful.... (y) thank u so much Dr.

[lonelywind]

You made an mistake with the weight of edge EG. It's 1 not 2...

[usergroupX]

Thank you! very helpful! It's giving me an idea for building random mazes !
 I'd like to point at something just for lolz : Computer terminal C cannot be connected to both D and G  (if the edge's weights represent distance  ;)