Network Flow Problems (HSC SSCE Mathematics Standard): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Starting point in network flow problems
Starting point in network flow problems
Source
Ending point in network flow problems
Ending point in network flow problems
Sink
What edge weights represent in network flow
What edge weights represent in network flow
Capacity - max amount that can flow through that connection
Principle: max flow limited by smallest capacity along path
Principle: max flow limited by smallest capacity along path
Bottleneck principle
Edge operating at maximum capacity
Edge operating at maximum capacity
Saturated edge
Max flow through pipes in series equals...
Max flow through pipes in series equals...
Capacity of the smallest individual pipe
Imaginary line separating source from sink
Imaginary line separating source from sink
Cut
Cut capacity formula
Cut capacity formula
Sum of capacities of edges crossing from source to sink side
Which edges count when calculating cut capacity?
Which edges count when calculating cut capacity?
Only edges flowing from source side to sink side
Maximum flow through network equals...
Maximum flow through network equals...
Capacity of the minimum cut