Flow, matching and scheduling problems
General Maths Units 3 and 4 (2023+)
Sorry!
This video is for subscribers only.
To view this video please support me by purchasing a (very cheap!) years access.
SubscribeVideos in this series
Please select a video from the same chapter
Downloadable Lesson notes
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]
Chapters
Want to skip to the best bits?
Gain access to chapters by taking out a (very reasonable and cheap!) one year plan
SubscribeDescription
This is an updated video for the Year 12 (Units 3 and 4) General Mathematics course relating to Networks and Flow. This video looks at what it means to have flow through a network and how we might measure and track the flow and what might limit the flow through the network. I take a look at what it means to Cut a network and what a Minimum Cut is. This is also related to Maximum Flow. I look at the many ways we can find the maximum flow through a digraph covering two of the best algorithms out there. I look at VCAA questions to show how the content might be assessed and where VCAA might have made a horrible question even more horrible! All of this is done in an easy to understand way.
LEGAL STUFF (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
Comments from YouTube
No comments at this time.
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
year 12 maths
grade 12 maths
flow problems
updated flow problems
general maths
units 3 and 4 maths
networks and flow problems
networks
vce general maths
vce maths
maximum flow and minimum cut
finding the minimum cuts
finding the maximum flow
cut algorithms
max flow algorithms