flow networks Definition. A flow network is a directed graph G=(, E)with two distinguished vertices:a source s and a sink t. Each edge(u, v)E E has a nonnegative capacity c(u, v). If(u, v) E, then c(u, v)=0 Example: c 2001 by Charles E Leiserson
Fixed -universe successor problem Goal: maintain a dynamic subset s of size n of the universe 0=10, 1,.,u-1 of size u subject to these operations INSERT(X∈U\\S): Add x to s DELETE(X E S): Remove x from S