WOLFRAM|DEMONSTRATIONS PROJECT

Find a Maximum Matching in a Bipartite Graph

​
number of vertices
6
8
10
20
random seed
1
2
3
4
5
show maximum matching
click on an edge to select or unselect it.
A matching in a graph is a set of edges
S
such that each vertex appears in at most one edge of
S
. Try to find a maximum matching: a matching using as many edges as possible. Click an edge to select or unselect it.