Practice Ford-fulkerson Algorithm (10.5) - Network Flows - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define a flow network.
Show hintHide hint
Think about the flow and paths in a directed graph.
Question 2.
What does the residual graph represent?
Show hintHide hint
Consider it as the remaining capacity after flow is processed.
3Question 3.
What defines a flow network?
- A graph where all edges are bidirectional.
- A directed graph with source and sink nodes.
- A graph with no edges.
Show hintHide hint
Think about the direction of the flow.
4Question 4.
True or False: Flow conservation means that inflow equals outflow at every node.
- True
- False
Show hintHide hint
Consider an intermediate node’s behavior.
Question 5.
Given a directed graph with capacities: S-A (10), A-B (5), B-T (10), S-C (15), C-B (5), C-T (10), calculate the maximum flow using the Ford-Fulkerson algorithm. Detail each augmenting path.
Show hintHide hint
Identify all possible augmenting paths step-wise.
Question 6.
A flow network has nodes: S, A, B, and T with C(S,A)=8, C(S,B)=10, C(A,T)=5, C(B,T)=5. Determine the maximum flow and explain why certain paths are chosen.
Show hintHide hint
Think about the paths that maximize capacity usage.

5 more questions in this section. Enroll free to practise them all.