# Exercise: The Ford-Fulkerson Algorithm

Test your understanding of the Ford-Fulkerson algorithm.

## We'll cover the following

## The task at hand

Grab some paper and a pen, and use the Ford-Fulkerson algorithm on the flow network given below to figure out the value of a maximum flow and the capacity of a minimum cut. Assume that the vertex $v_1$ is the source and the vertex $v_7$ is the sink.

You can verify your solution by clicking the “Run Ford-Fulkerson” button.

Note:

- You can also experiment on a different flow network using these
instructions. instructions - If you choose to add a new edge, its weight will be generated randomly.
- If the automatically generated labels overlap with vertices or edges, you may view them more clearly by dragging the vertices of the given digraph (after selecting the “Drag vertices” checkbox).

Get hands-on with 1200+ tech skills courses.