Hungarian Algorithm: determining the minimum number of lines to cover all zeros

Question

I am trying to implement the Hungarian Algorithm. Check the Wikipedia steps: https://en.wikipedia.org/wiki/Hungarian_algorithm#Matrix_interpretation

Consider the followin