Find a Maximum Matching in a Bipartite Graph
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A matching in a graph is a set of edges such that each vertex appears in at most one edge of . Try to find a maximum matching: a matching using as many edges as possible. Click an edge to select or unselect it.
Contributed by: Stan Wagon (April 2012)
Open content licensed under CC BY-NC-SA
"Find a Maximum Matching in a Bipartite Graph"
Wolfram Demonstrations Project
Published: April 20 2012