A flow network is a directed graph where each edge has a capacity, and the Ford-Fulkerson algorithm computes the maximum flow from a source to a sink. These tutorials walk through the theory and implementation step by step.
What you’ll learn in Flow Networks
- Flow networks, capacities, sources, sinks, and the value of a flow
- The Ford-Fulkerson method and augmenting paths on the residual graph
- Max-flow/min-cut theorem and why it matters
- The Edmonds-Karp refinement and its complexity
Related tutorials & topics
Explore every tutorial and course in the Content Directory, or read more on the Genius Blog.