General · Networks · assignment optimisation

Hungarian algorithm — optimum assignment

Row and column reduction, then cover zeros with the fewest lines — each step keeps the same optimal matching while simplifying the matrix.

Original costs

Steps so far

This original stays put. Press Next — each step below is a new, reduced matrix.

Bipartite view

Problem

Algorithm

Ready — press Next to begin row reduction.

The original costs stay as the main matrix. Each Next adds a reduced copy below.

Working

Picking smallest costs independently can fail — the Hungarian method guarantees an optimum one-to-one assignment.