Maximum flow problem
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem.
=======Image-Copyright-Info========
License: Creative Commons Attribution-Share Alike 3.0 (CC-BY-SA-3.0)
LicenseLink: http://creativecommons.org/licenses/by-sa/3.0/
Author-Info: Min_cut.png: Maksim derivative work
آی-ویدئو