A minimum spanning tree finds a spanning tree with a minimum weight. Weights can represent cost of construction, travel time, etc., so finding the least time or cost is of importance to us.
In our first algorithm, we explore Prim's Algorithm. In Prim's Algorithm, we search for the least weight of edges incident to any VISITED vertex. Note, the focus of this video is on carrying out Prim's Algorithm by hand and not on how to construct the program that will run the algorithm.
Video Chapters:
Intro 0:00
Minimum Spanning Tree 0:09
Prim's Algorithm 0:48
Practice With Me 3:54
Practice On Your Own 7:52
Up Next 12:52
This playlist uses Discrete Mathematics and Its Applications, Rosen 8e Power Point slide decks to accompany the videos can be found here: https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0
The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ
