Finding Minimum Spanning Trees with Kruskal's and Prim's Algorithms

In this lesson, I am going to teach you how to find a minimum spanning tree using Kruskal's algorithm and Prim's algorithm. This is a lesson under Math in Decision Science What is a spanning tree? A spanning tree obtained from a graph is a tree that uses all the original vertices. A minimal spanning tree (MST) is a spanning tree with the total weight of its edges as small as possible. ⏲️ Timestamps ⏲️ Introduction (0:00) Muddy City Problem (0:15) Trees, Spanning tree and Minimum Spanning Tree (2:10) Steps in Kruskal's Algorithm (9:52) Steps in Prim's Algorithm (20:29) Solution to Muddy City Problem (33:26) #mathhubtv #MST #GEMATMW WANT TO WATCH MORE VIDEOS LIKE THIS? 📺 Subscribe to my channel here: https://www.youtube.com/c/MathHubTV CONNECT WITH US 👍 Facebook: https://www.facebook.com/mathhubtutorials 🐦Twitter: https://twitter.com/mathhub303 NEED PERSONAL ONLINE TUTORIALS? Contact us at mathub303@gmail.com https://mathhubtutorial.com/tutorials/ 🙋‍♂️ Have questions? I'm here to help you learn your math courses in an easy way. Leave a comment below and I will try to answer it as soon as I can. You can also leave topics that you need help with and I will create those videos for you.