next up previous
Next: Flow Up: CSE 2320: Algorithms and Previous: Maximum Flow

Flow Networks

A flow network G = (V, E) is a directed graph where each edge (u,v) $\in$E has capacity c(u,v) $\geq$ 0.

If (u,v) \(\not \in\) E, then c(u,v) = 0.

Distinguish source (s $\in$ V) and sink (t $\in$ V) as the vertices between which the flow is to be maximized.

For every v $\in$ V, v is on a path from s to t. \(s \leadsto v \leadsto t\), therefore the graph is connected.

\(\mid E \mid \;\geq\; \;\mid V \mid \;-\; 1\)



\psfig{figure=figures/f19-1.ps}



Copyright © 1998 The University of Texas at Arlington