Maximum Flow

Problem:

Given a network of conduits and junctions, where each conduit has a maximum capacity, calculate the maximum flow rate of material between two junctions.

Solution:

Represent flow network as a directed graph with vertices as junctions and edges as conduit.
Edge weights are capacities.
Use Ford-Fulkerson method to find maximum flow.

Applications:

Materials processing
Assembly-line scheduling
Freight transportation