Graphs and networks
General Mathematics: Units 1 and 2
Introduction
Welcome
Learning objectives
Recap of past learning
What is a tree?
What is not a tree?
Rules connecting edges and vertices
Spanning Trees
Minimum Spanning Trees
Finding the minimum spanning tree
Example: Applying Prim's Algorithm
VCAA Example: 2019 FM Exam 1
VCAA Example: 2020 FM Exam 1
Final remarks
This video will help you master the concept of Minimum Spanning Trees which is a part of the Year 11 General Maths course. I take a look at what a tree is (other than the thing which grows in forests) and how we can find trees in graphs. I also look at what a tree is NOT! Having done this I talk a little about minimum spanning trees and how they can be found using Prim's Algorithm. With the theory out of the way I look at two VCAA past paper questions which have assessed this area of work. The video is filled with helpful advice and taught in a way which "just makes sense".
LEGAL STUFF (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
There are no current errors with this video ... phew!
Click the link below to download your notes.
If your lesson notes are not downloading this is due to your school blocking access to the notes server. If you try connecting at home, or using a different computer which is not controlled by your school, you will be able to download the notes.
Video tags
maffsguru
good maths videos for middle school
good maths videos
good maths videos for high school
good maths website
good maths teacher
maffs guru
vce maths
darren smyth
maths tutorials
minimum spanning trees
what is a tree
how did I find the minimum span in a tree
graphs theory
graphs and networks
vce general maths
general units 1 and 2
year 11 general
year 11 maths
grade 11 maths
prim's algorithm
how to use prim's algorithm
prims algorithm