General Maths Units 3 and 4

Trees and minimum connector problems

Graphs, networks and trees: travelling and connecting problems

14:14 Lesson length
11 Chapters
Video thumbnail
Ready to watch the full lesson?

MaffsGuru members enjoy a full year of clear, classroom-style maths videos — plus notes, worksheets, and tools to help you learn and revise with confidence. One simple membership, one-off payment, and no auto-renewal.

Current chapter
Watch progress
0%
Playback speed
1.0×
Course
Graphs, networks …
About this lesson
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.

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 Trees and minimum connector problems
  • Section Graphs, networks and trees: travelling and connecting problems
  • Course General Maths Units 3 and 4

I would be grateful if you can support my work by subscribing to my YouTube channel.

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
Loading comments…
Chapter index
Select a line to jump to that point in the video.

Chapter navigation is available to members.