Cut Property of Minimum Spanning Trees & Algorithms (Graphs: Algorithms & Theory)

Channel:
Canada PageWizard Games, Learning & Entertainment
Subscribers:
785
Published on ● Video Link: https://www.youtube.com/watch?v=D8GK8FvmmxA


Duration: 34:08
138 views
4

In today's lesson, we learn about the cut property and how it can be used to derive a couple different algorithms that solve the Minimum Spanning Tree (MST) problem! The blob's way is an optimal way!

Time Stamps:
0:00 Opening
1:52 Cut Property, statement of the theorem, example (it must be stressed that one set of vertices need not be a collection of adjacent of vertices)
8:31 Proof of the Cut Property
20:30 How we can use the cut property to derive algorithms to compute MSTs!? Prim's Algorithm and Kruskal's Algorithm.

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



Other Videos By PageWizard Games, Learning & Entertainment


2022-11-02Dijkstra's Algorithm WITH FULL EXAMPLE (Graphs: Algorithms & Theory)
2022-10-31Single-Source Shortest Path Problem (Graphs: Algorithms & Theory)
2022-10-28Showing an Algorithm is Incorrect (Example 2)
2022-10-28Dan Plays Legend of Zelda: Link's Awakening DX & The Crystal of Kings
2022-10-26Showing an Algorithm is Incorrect (Example 1)
2022-10-25Single-Source Shortest Path Problem and Dijkstra's Algorithm
2022-10-24How Do We Know Algorithms are Incorrect?
2022-10-21Prim's Algorithm in Under 1 Minute - Think Like The Blob! (Graphs: Algorithms & Theory)
2022-10-19Summations, Closed Forms, and Simplifying Them: A Tutorial
2022-10-19How Do We Know An Algorithm is Incorrect, Shortest Paths, and Minimum Spanning Trees!
2022-10-17Cut Property of Minimum Spanning Trees & Algorithms (Graphs: Algorithms & Theory)
2022-10-14Introduction to Mathematical Sequences, and How to Derive a Sequence
2022-10-14Dan Plays Legend of Zelda: Link's Awakening DX
2022-10-12Minimum Spanning Trees & Optimization Problems (Graphs: Algorithms & Theory)
2022-10-11Minimum Spanning Trees and the Cut Property, Taking Your Questions!
2022-10-10Graph Terminology III: Weighted Graphs (Graphs: Algorithms & Theory)
2022-10-07Computing Connected Components of a Graph (Graphs: Algorithms & Theory)
2022-10-06Dan Plays Legend of Zelda: Link's Awakening DX (GB Colour, COME JOIN THE FUN!)
2022-10-05Testing Connectivity of a Graph (Graphs: Algorithms & Theory)
2022-10-03Counting Reachable Vertices and Edges (Graphs: Algorithms & Theory)
2022-09-30Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory)


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
minimum spanning tree
kruskal
prim
prim-jarnik
cut property
algorithms
theory
proof of correctness