General Maths Units 1 and 2

Minimum Spanning Trees and Greedy Algorithms

Graphs and networks

22:09 Lesson length
15 Chapters
Ask a question
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 and networ…
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.

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.

maffsguru good maths videos for middle school good maths videos good maths videos for high school good maths website good maths teacher maffs guru darren smyth maths tutorials minimum spanning trees shortest path using Dijkstra's algorithms general maths units 1 and 2 maths vce maths mathematics greedy algorithms finding the minimum spanning trees prim's algorithm kruskal's algorithm
Practice questions

Graphs and networks · Minimum spanning trees and greedy algorithms — Work through original practice questions linked to this lesson.

Bronze members can practise questions from the first chapter of each course. Unlock every chapter with Silver or Gold.

Upgrade account
Got a question?

Lesson discussion

Stuck on a step? Wondering about a concept? Leave a question below — Darren and the MaffsGuru team read every comment.

Loading discussion…