Question 1
In a flow network, what does the term 'residual capacity' refer to?
Question 2
Which algorithm is best suited for finding the maximum flow in a flow network?
Question 3
In the context of network optimization, what does a 'cut' represent?
Question 4
What is the primary goal of a minimum-cost flow problem?
Question 5
Which of the following statements about Dijkstra's algorithm is true?
