Maximum matching by augmenting paths animated — free partners taken directly, occupied ones displaced along chains, one extra match per augmentation.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Bipartite Matching Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Maximum matching by augmenting paths animated — free partners taken directly, occupied ones displaced along chains, one extra match per augmentation. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Ford-Fulkerson Max Flow Visualizer: Max flow animated: BFS finds augmenting paths, the bottleneck is pushed through, saturated edges turn red — ending at the min cut that equals the max flow.
Open toolVertex Cover Approximation Visualizer: The classic 2-approximation animated: take both endpoints of uncovered edges and get a provable ≤2×OPT guarantee for an NP-hard problem.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open toolmatched: 0/4
1Maximum bipartite matching (jobs ↔ workers) via augmenting paths: for each left node, find a free right partner — or CHAIN displacements ("give up your match, take another") until someone free is found.
for each left node u:DFS for an augmenting path:free right node → match itelse ask its owner to move onpath found → matching grows by 1König: max matching = min vertex cover
Match jobs to workers: each new left node either takes a free partner or triggers a chain of re-assignments. Max-flow with unit capacities under the hood.
