Max Flow Problem – Introduction | Algorithms
• Maximum flow problems find a feasible flow through a single-source, single-sink flow network that is maximum. • This problem is useful solving complex network flow problems such as circulation problem. • The maximum value of the flow (say source is s and sink is t) is equal to the minimum capacity of an s-t cut in network (stated in max-flow min-cut theorem). • In maximum flow graph, Incoming flow on vertex is equal to outgoing flow on that vertex (except for source and sink vertex)