MaffsGuru doesn't record just any maths videos. They’re clear, engaging, and designed to help you actually understand — not just memorise and hope for the best..
Title: Dijkstra's algorithm (Updated)
Section: Graphs, networks and trees: travelling and connecting problems
Course: General Maths Units 3 and 4
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.
These are other videos in the same section of this course.
Sorry!
This video is for subscribers only.
To view this video please support me by purchasing a (very cheap!) years access.
PricingThis video is part of the Year 12 VCE (Units 3 and 4) General Maths course and looks at part of the content required for Networks. Dijkstra's algorithm used to be something which was confusing and had the most bizarre algorithm but not any more. This video looks at how to find the shortest part problems using Dijkstra's algorithm in the simplest possible way. The algorithm now makes sense and will allow all students to smash this content. There are lots of worked examples and they are explained in an easy 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
0 comments have been posted.
Add comment to video