Home▸Networks & Graph Theory▸Bipartite Matching (Augmenting Paths): 2D Graph

🔗 Bipartite Matching (Augmenting Paths): 2D Graph

Kuhn's augmenting-path algorithm finding a maximum matching on a random bipartite graph, step by step.

Networks & Graph Theory2DModerate60 FPS📱 Mobile-adapted⇄ 3D version

⚙ Under the hood

Kuhn's augmenting-path algorithm finding a maximum matching on a random bipartite graph, step by step.

bipartite matchingaugmenting pathgraph algorithms

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install