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.
Videos in this series
Please select a video from the same chapter
Want to skip to the best bits?
Gain access to chapters by taking out a (very reasonable and cheap!) one year plan
This is a great video for the Further Maths Units 3 and 4 series of Networks. Having looked at what graphs are and how we can use them, I move onto the idea of the more useful weighted graphs. I look at what a weighted graph is and how to read it. I then move onto the idea of shortest path and how to find it by observation and using Dijkstra's algorithm. Whilst it might seem like Voodoo ... it's actually pretty funky! There are some worked examples explaining the theory all delivered using my unique style.
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!
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]
Video tags
vce maths
maths tutorials
Dijkstra's algorithm
weight graphs
weighted graphs and networks
vce futher
vce further maths
further maths
unit 3 and 4 maths
year 12 maths
grade 12 maths
weighted networks
shortest path problems
finding the shortest path
