Video Details

Title: Minimum Spanning Trees and Greedy Algorithms

Section: Graphs and networks

Course: General Maths Units 1 and 2

Share video:

I would be really grateful if you can support the work I do by subscribing to my YouTube Channel. It really just tells me that people are watching and appreciating the content.

    Want to skip to the best bits? Gain access to chapters by taking out a (very reasonable and cheap!) one year plan.

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

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
Minimum Spanning Trees and Greedy Algorithms
Thumbnail

Sorry!

This video is for subscribers only.

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

Pricing
About 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 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

Comments for this lesson

0 comments have been posted.

Add comment to video

Required for comment verification