Max-Flow Min-Cut Theorem (Ford Fukersons Algo
What is Network Flow ?
Flow network is a directed graph G=(V,E) such that each
edge has a non-negative capacity c(u,v)0.
Two distinguished vertices exist in G namely :
Source (denoted by s) : In-
Create(S) creates an empty stack
Push(S,x) insert x into the stack
)Pop(S) extracts the last inserted item (returns void
Is_Empty(S) boolean true if stack is empty
Top(S) returns the top item on the stack
Create(Q) Creates an empty