Reflections on Augmenting Paths | 245
Network Flow
Algorithms
no other way to meet the customer needs; indeed, when this happens, note how
the augmented path reduces the existing flows between Washington, D.C. (v 2 )
and Houston (v 3 ), as well as between Washington, D.C. (v 2 ) and Boston (v 4 ).
Figure 8-7. Side-by-side computation showing difference when considering the minimum
cost flow
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