Wolfram Demonstrations Project

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.

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

RELATED RESOURCES

Mathematica » The #1 tool for creating Demonstrations and anything technical.	Wolfram\|Alpha » Explore anything with the first computational knowledge engine.	MathWorld » The web's most extensive mathematics resource.	Course Assistant Apps » An app for every course— right in the palm of your hand.
Wolfram Blog » Read our views on math, science, and technology.	Computable Document Format » The format that makes Demonstrations (and any information) easy to share and interact with.	STEM Initiative » Programs & resources for educators, schools & students.	Computerbasedmath.org » Join the initiative for modernizing math education.

Find a Maximum Matching in a Bipartite Graph