Network Flow Problems (HSC SSCE Mathematics Standard): Quizzes

📚Quizzes
Network Flow Problems
Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

10 questions from this quiz

Show

In network flow problems, what is the source?

The starting point of the flow

Two pipes in series carry 2525 and 5858 litres/min. What is the max flow through both?

2525 litres per minute

What does it mean when an edge is saturated?

It operates at maximum capacity

A path has edges with capacities 400400, 250250, and 600600. What is the max flow?

250250

What is a cut in network flow?

A line separating source from sink

What makes a cut valid?

It completely separates source from sink

When calculating cut capacity, which edges do we count?

Edges from source side to sink side

What does the maximum-flow minimum-cut theorem state?

Max flow equals minimum cut capacity

A cut crosses edge B→C (capacity 1414) and F→B (capacity 66, sink→source). What to count?

Only B→C with capacity 1414

Two paths A→E carry max flows of 300300 and 150150. What is overall max flow from A to E?

450450

Join 100,000+ SSCE students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.