Network Flow
← Back to Graph Algorithms
Algorithms for computing the maximum flow through a network from a source to a sink. Network flow models problems in transportation, bipartite matching, and resource allocation.
Key Properties
Related
- Shortest Path (Edmonds-Karp uses BFS)