Find a Maximum Matching in a Bipartite Graph

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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

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 »

Files require Wolfram CDF Player or Mathematica.