Tool guide

Max Flow, Min Cut and Bipartite Matching in the Browser

The Flow & matching panel covers three related jobs on the shared canvas from the graph workbench: a maximum flow from a source to a sink with Dinic or Edmonds–Karp, a bipartite check that colours the graph or produces an odd cycle as a counterexample, and Hungarian maximum matching with the Kőnig minimum vertex cover. Flow results come with the min-cut capacity, the cut edges and the source side of the cut, so the answer carries its own proof.

Updated Reviewed by CalcX Editorial Team5 sources4 min read