For K-12 Students · Bipartite Matching
Bipartite Matching for a call graph
Built for k-12 students learning it in middle or high school. Watch the idea come alive with plain-language steps and everyday examples — perfect for projects and homework. Simulate a call graph live below — adjust the inputs and watch it respond, right in your browser.
Bipartite MatchingLive
assignment problem
Controls
Presets
Maximum bipartite matching pairs items from two groups — workers to jobs, students to schools, organs to recipients — so that as many valid pairings as possible are made, with no one assigned twice. Kuhn's algorithm repeatedly finds augmenting paths that improve the matching. The green edges are the optimal assignment.
Data Inspector
Matched pairs0
Max possible6
Methodaugmenting paths
Governing equation
Reading this result: Only 0 of 6 paired: at 40% density the graph is too sparse, so many workers have no eligible job and augmenting paths run out early.
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
More with Bipartite Matching
Bipartite Matching for a road networkBipartite Matching for a social graphBipartite Matching for a subway mapBipartite Matching for a supply networkBipartite Matching for a flight networkBipartite Matching for a power gridBipartite Matching for a computer networkBipartite Matching for a citation graph
Frequently asked questions
- Is this good for k-12 students?
- Yes — this version of "Bipartite Matching for a call graph" is framed for k-12 students learning it in middle or high school. Watch the idea come alive with plain-language steps and everyday examples — perfect for projects and homework.
- Do I need to install anything?
- No. It runs in any modern browser, free, with no account required.