Dijkstra's algorithm (Updated)
Graphs, networks and trees: travelling and connecting problems
General Maths Units 3 and 4 (2023+)
MaffsGuru Logo Sitting


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
Video Thumbnail Video Thumbnail Video Thumbnail Video Thumbnail Video Thumbnail

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

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.
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

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