next up previous
Next: Ford-Fulkerson Method Up: CSE 2320: Algorithms and Previous: Flow

Maximum-Flow Problem

Given flow network G, with source s and sink t, find flow with maximum value from s to t.

Multiple Sources And Sinks



\psfig{figure=figures/f19-2.ps,width=4in,height=2in}



Copyright © 1998 The University of Texas at Arlington