Maximum Flow Problems

• Defined on a Network

  • Source Node s
  • Sink Node t
  • All Other Nodes are Transshipment Nodes
  • Arcs have Capacities, but no Costs

• Maximize the Flow from s to t

Previous slide

Next slide

Back to first slide

View graphic version