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..
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.
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.
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 ;)