General Maths Units 3 and 4

Weighted graphs and networks

Graphs, networks and trees: travelling and connecting problems

18:06 Lesson length
10 Chapters
Video thumbnail
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 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.

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 Weighted graphs and networks
  • 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.

vce maths maths tutorials Dijkstra's algorithm weight graphs weighted graphs and networks vce futher vce further maths further maths unit 3 and 4 maths year 12 maths grade 12 maths weighted networks shortest path problems finding the shortest path
Loading comments…
Chapter index
Select a line to jump to that point in the video.

Chapter navigation is available to members.