Question

What does Maximum flow problem involve?

(a) finding a flow between source and sink that is maximum

(b) finding a flow between source and sink that is minimum

(c) finding the shortest path between source and sink

(d) computing a minimum spanning tree

I got this question by my school principal while I was bunking the class.

My doubt stems from Flow Networks topic in section Flow Networks of Data Structures & Algorithms II

Answer 1

Correct option is (a) finding a flow between source and sink that is maximum

Easy explanation - The maximum flow problem involves finding a feasible flow between a source and a sink in a network that is maximum and not minimum.