Chapters

Introduction

Welcome

Learning objectives

Recap of past learning

Directed graphs

Minimum flow

Maximum flow

Example

Cuts

Capacity of a cut

Mnimum cut capacity

Example

Final words

Subscribe please

Flow problems

Flow, matching and scheduling problems

Year 12

This is another video in the series on Networks for Further Maths. I take a look at flow problems (and I don't mean when going to the toilet!) for networks. We look at capacities, cuts, maximum flow and minimum capacity and see how they apply to digraphs and networks. There are a number of worked examples all related back to the theory.

Published: July 2, 2021

Length: 00 mins and 00 seconds

Lesson notes

Lesson notes are provided in PDF format and can be downloaded by clicking the link below:

Exam resources

Click the button below to view VCAA exam question(s) and video solutions which match this topic.

2020 Paper 2 Networks module

2020 Paper 2 Networks module

2020 Paper 1 Networks module

Video tags

vce maths
maths tutorials
flow problems
further maths
vce further maths
unit 3 and 4 maths
maximum capacity
cuts and capacity
cuts networks
digraphs
networks module
grade 12 maths
year 12 maths
finding the minimum cut in a graph
minimum cut
graphs and cuts
graph theory

LEGAL STUFF

Where videos relate to VCE and I have used VCAA questions the following should be noted:

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