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
Disioint-set data structure (Union-Find) Problem: maintain a dynamic collection of pairwise-disjoint sets S=(S Each set S; has one element distinguished as the representative element, rep[sil lust support 3 operations