Hungarian Algorithm ·
Optimal Assignment
un
seel
.com · Min-cost matching · Row/col reduction · O(n³)
Matched cost
—
Phase
0 / 3
State
—
Cost (taller = pricier)
Reducing row / column
Zero cell (free edge)
Chosen assignment
Play
←
→
Unmute
Reset
Un
seel
.com · Hungarian Algorithm