MAX FLOW

Max Flow - Min Cut theorem - The maximum flow through a (single commodity) capacitated network from a specified node, called the source, to another node, called the sink, equals the value of the minimum cutset . Originally proven directly from principles of networks, this was discovered to be a special case of the Duality Theorem of Linear Programming .