Trouble with last step of hungarian algorithm (algorithm to find a set of zeros)

I have implemented everything up to the final step, where the minimum number of lines required to cover all the zeros = n of the nxn matrix.

Originally, I planned on doing a greedy selection where I would iterate through the 2d array column by column and pick the first zero found. Quickly enough, found that was a terrible idea, and didnt even work for my small 5x5 matrix (the real thing will likely be a matrix where n is around 100-200 in size).

Only one zero can be selected per...

Read More »

By: StackOverFlow - 5 days ago

Related Posts