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.
good maths videos for middle schoolgood maths videosgood maths videos for high schoolgood maths websitegood maths teachermaffs gurudarren smythmaths tutorialsDijkstra's algorithmyear 12 general mathsvce mathsvce general mathsunits 3 and 4 mathsnetworksshortest path problemfinding the shortest part through a network