Summary
Full Transcript
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 second algorithm, we explore Kruskal's Algorithm, where we are not limited by choosing edges incident to those vertices already chosen in our MST. Just choose the least weight edge provided it doesn't form a cycle. Note, the focus of this video is on carrying out Kruskal's Algorithm by hand and not on how to construct the program that will run the algorithm. Video Chapters: Intro 0:00 Kruskal's Algorithm 0:07 Practice With Me 1:40 Practice On Your Own 4:06 Up Next 7:00 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
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
