About this lesson
This is the final video in the series and looks at some greedy algorithms to help us find minimum spanning trees (and, as extension, shortest path). I look at how to use Prim's Algorithm, Kruskal's Algorithm to find the minimum spanning tree and Dijkstra's Algorithm to find the shortest path. This video forms part of the General Mathematics course here in Australia for the VCE (Units 1 and 2). The content is explained in an way to understand way.
Lesson chapters
- Welcome
- Learning Objectives
- Recap of past learning
- What is a tree?
- What is NOT a tree
- Rule connecting vertices and edges for trees
- Spanning Trees
- Minimum Spanning Trees
- Prim's Algorithm: Minimum Spanning Tree
- Example 1: Prim's Algorithm
- Kruskal's Algorithm: Minimum Spanning Tree
- Example 1: VCAA Question
- Example 2: VCAA Question
- Extension: Dijkstra's Algorithm
- Learning Objectives: Revisited
Legal (VCAA)
VCE Maths exam question content used by permission, ©VCAA. The VCAA is not affiliated with, and does not endorse, this video resource. VCE® is a registered trademark of the VCAA. Past VCE exams and related content can be accessed at www.vcaa.vic.edu.au
Video details
-
Title
Minimum Spanning Trees and Greedy Algorithms
-
Section
Graphs and networks
-
Course
General Maths Units 1 and 2
I would be grateful if you can support my work by subscribing to my YouTube channel.