Live Streamed Year 12 General Maths on Twitch and YouTube: Click here for information
Flow problems
Flow, matching and scheduling problems
General Maths Units 3 and 4 2023+
MaffsGuru Logo Sitting
Search Content
The search results will appear here when you have selected something to find. Please try searching for something
Videos in this series
Please select a video from the same chapter
Video Images Video Images Video Images Video Images
Lesson notes

LEGAL STUFF

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
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
Description

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.
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