A matching is a set of edges such that no two edges share a common vertex. Find the matching that maximizes the sum of weights
Intuition
- Set A (red) is job applicants, Set B (blue) is companies. The edge weights [0,1] represent how suitable a person is for the job they applied to
- Red and and blue are two friend groups. Each edge weight represents the compatibility score between people of each group
- Set A is people calling an Uber, B is the drivers. Weights represents how convenient it is for the driver to pick up each passenger
Instructions
- Click and drag nodes to move them around
- Click on the edges to select/unselect them in the matching
- Use the Check button to verify if your matching is optimal
- Use Reset to start over with new random weights
- Change the number of nodes in each set on the top right