PPT Slide

Formulate a maximum flow problem that will tell Fly-By-Night

how to reroute as many passengers from San Francisco to

New York as possible.

SF

D

H

C

A

NY

(4,5)

(2,2)

(2,4)

(5,5)

(2,4)

(7,7)

(flow, capacity)

(5,6)

Previous slide

Next slide

Back to first slide

View graphic version