Jump to content

File talk:Hungarian algorithm unbalanced assignment problem example.svg

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by 109.147.202.77 (talk) at 14:52, 21 December 2023 (should be step 2, not step 1). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

I don't think this works in the general case. You could have a matrix of 1s, and when you subtract 1 from each column as per step 2 (excepting the dummy column), the entire matrix goes to zero. Then there are no rows with exactly one zero, and the algorithm cannot proceed. 109.147.202.77 (talk) 14:52, 21 December 2023 (UTC)[reply]