# Exercise: Maximum Matchings in Bipartite Graphs

Test your understanding of how to find a maximum matching in a bipartite graph using 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 to find a maximum matching in the following bipartite graph.

You can verify your solution by clicking the “Find Maximum Matching” button.

Note:

- You can also experiment on a different bipartite graph using these
instructions. instructions - If the automatically generated labels overlap with vertices or edges, you may view them more clearly by dragging the vertices of the given graph (after selecting the “Drag vertices” checkbox).

Get hands-on with 1200+ tech skills courses.