Description
This is a great video for the Further Maths Units 3 and 4 series of Networks. Having looked at what graphs are and how we can use them, I move onto the idea of the more useful weighted graphs. I look at what a weighted graph is and how to read it. I then move onto the idea of shortest path and how to find it by observation and using Dijkstra's algorithm. Whilst it might seem like Voodoo ... it's actually pretty funky! There are some worked examples explaining the theory all delivered using my unique style.