Search by Topic

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There is 1 result

Broad Topics > Decision Mathematics and Combinatorics > Flows in a network

problem icon

Maximum Flow

Stage: 5 Challenge Level: Challenge Level:1

Given the graph of a supply network and the maximum capacity for flow in each section find the maximum flow across the network.


The NRICH Project aims to enrich the mathematical experiences of all learners. To support this aim, members of the NRICH team work in a wide range of capacities, including providing professional development for teachers wishing to embed rich mathematical tasks into everyday classroom practice. More information on many of our other activities can be found here.
Copyright © 1997 - 2012. University of Cambridge. All rights reserved.
NRICH is part of the family of activities in the Millennium Mathematics Project.