Algorithms in a Nutshell

(^230) | Chapter 8: Network Flow Algorithms
Input
The flow network is defined by a graphG=(V,E) with designated start vertexs
and sink vertext. Each directed edgee=(u,v)inEhas a defined integer capacity
c(u,v) and actual flowf(u,v).
Figure 8-3. Ford-Fulkerson fact sheet
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use