If you can't read please download the document
Upload
britney-owen
View
217
Download
0
Embed Size (px)
DESCRIPTION
Network We have a digraph G with edge capacities u: E(G)→ R + and two specified vertices s (the source) and t (the sink). The quadruple (G, u, s, t) is sometimes called a network. Our main motivation is to transport as many units as possible simultaneously from s to t. A solution to this problem will be called a maximum flow.