Flow networks Definition. A flow network is a directed graph G=V, E)with two distinguished vertices:a source s and a sink t. Each edge(u, v)E Ehas a nonnegative capacity c(u, v). If(u,v)EE then c(u, v)=0 Example: c 2001 by Charles E Leiserson Introduction to Agorithms Day38L22.2© 2001 by Charles E. Leiserson Introduction to Algorithms Day 38 L22.2 Flow networks Definition. A flow network is a directed graph G = (V, E) with two distinguished vertices: a source s and a sink t. Each edge (u, v) ∈ E has a nonnegative capacity c(u, v). If (u, v) ∉ E, then c(u, v) = 0. Example: ss tt 3 2 3 3 2 2 3 1 3 2 1