About this lesson
This 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.
Lesson chapters
- Welcome
- Learning objectives
- Recap of past learning
- RECAP: Shortest path problems
- Dijkstra's algorithm
- Dijkstra's algorithm: An example
- Dijkstra's algorithm: Example 2
- Dijkstra's algorithm: Example 3
- VCAA Exam Question on Dijkstra's algorithm
- Final words and Summary
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
Dijkstra's algorithm (Updated)
-
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.