The Network Flow Problem applies to computer networks,
factory to warehouse decisions, city planning, and other flow networks.
Applications
Computer Networks
The vertices are the computers in the network
The edges are the connections with capacties of their respective bandwidths
How should the packets be sent from the source computer to the sink
computer to move a file fast enough?
Warehouse to Factory
The vertices are the intersections of roads and the factories and warehouses.
The edges are the roads with capacites of how much can be transported
between the connected veritices
How should the trucks be deployed to move the most items at a time?
If there is more than one factory or warehouse, then the source (or
sink) is an imaginary vertex that is connected to the factories (or warehouses)
be edges with weights of the factories (or warhouses) production (or holding)
capacity.
City Planning
The vertices are road, sewer, or subway intersections
The edges are the connections between the intersections with weights
of their resepective capacities
Is the network capable of transporting what is needed by the city,
and how to upgrade so that is does?
