Find a Maximum Matching in a Bipartite Graph

Initializing live version
Download to Desktop

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)
(Macalester College)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.