next up previous
Next: Flow Networks Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

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 method to find maximum flow.
Applications:
Materials processing
Assembly-line scheduling
Freight transportation



Copyright © 1998 The University of Texas at Arlington