Minimum Spanning Trees & Optimization Problems (Graphs: Algorithms & Theory)
In today's lesson, we will learn what a minimum spanning tree is, how/why you might consider them for problem formulations, then we discuss what an optimization problem is.
Time Stamps:
0:00 Opening, recap of terminology; what is a spanning tree?
4:02 How do we compute a spanning tree?
4:36 What is a minimum spanning tree? Motivation with lazy turkeys and planning/applications.
14:45 What is the minimum spanning tree (MST) problem?
16:20 What is an optimization problem? Discussion and definition.
25:18 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#Algorithms
#graphtheory