Graphs, networks and trees: travelling and connecting problems

General Maths Units 3 and 4 (2023+)

Sorry!

This video is for subscribers only.

To view this video please support me by purchasing a (very cheap!) years access.

SubscribeLesson notes

Lesson notes for this video are for subscribers only. Sorry! To gain access, please consider supporting me by taking out a (very reasonable and cheap!) one year plan by [clicking here]

LEGAL STUFF

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

Chapters

Want to skip to the best bits?

Gain access to chapters by taking out a (very reasonable and cheap!) one year plan

SubscribeDescription

This is another video in the series relating to Networks for the Further Maths course. Moving into more exciting stuff which now looks at using the theory we have learned, I take a look at tress, minimum spanning trees and minimum connector problems. They are all pretty much the same and look at how we can connect vertices in the most efficient ways. I look at using Prim's Algorithm to find the minimum spanning tree with lots of worked examples to show how to apply it.

Video tags

vce maths
maths tutorials
spanning trees
minimum spanning trees
connector problems
vce further maths
networks module
further maths
Trees and minimum connector problems
prims algorithm
grade 12 maths
year 12 maths
trees and minimum spanning trees
finding the minimum spanning tree