Minimum lines for Hungarian Algorithm

问题

I want to know the minimum number of lines covering all the Zeros for Hungarian Algorithm. Ive followed this link, but the code there is a greedy one.

Hungarian Algorithm: How to cover 0 elements with minimum lines?

For example,

{0,0,1,1},
{1,0,0,1},
{1,0,1,0},
{1,1,1,1},

This case fails. I should get output 3. But the output this solution gives is 4.

Any other ways of solving it would be a great help.

Thanks

来源：https://stackoverflow.com/questions/19288464/minimum-lines-for-hungarian-algorithm