General Maths Units 3 and 4

Dijkstra's algorithm (Updated)

Graphs, networks and trees: travelling and connecting problems

10 Chapters
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, networks …
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
  1. Welcome
  2. Learning objectives
  3. Recap of past learning
  4. RECAP: Shortest path problems
  5. Dijkstra's algorithm
  6. Dijkstra's algorithm: An example
  7. Dijkstra's algorithm: Example 2
  8. Dijkstra's algorithm: Example 3
  9. VCAA Exam Question on Dijkstra's algorithm
  10. 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.

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 Dijkstra's algorithm year 12 general maths vce maths vce general maths units 3 and 4 maths networks shortest path problem finding the shortest part through a network
Loading comments…
Chapter index
Select a line to jump to that point in the video.

Chapter navigation is available to members.