What if there are multiple zeros in Hungarian law?

What should I do if there are multiple zeros when solving the maximum matching of bipartite graphs by Hungarian method? Here are some suggestions:

1. Continue to use Hungarian algorithm, because it is very effective in dealing with bipartite graphs.

2. If there are multiple zeros, you can consider using other algorithms, such as KM algorithm or branch-and-bound algorithm. These algorithms can handle multiple zeros better.

You can try to deform the bipartite graph so that it does not contain multiple zeros. The specific method is to connect all vertices in a vertex set to their corresponding virtual vertices, and then solve them by Hungarian algorithm.

4. If there are multiple zeros in the bipartite graph, the extended Hungarian algorithm can be used. The algorithm adds two steps to the original Hungarian algorithm: the first step is to add a weight to all the edges adjacent to 0, and the second step is to ignore these edges with a weight of 0 in the search of augmented paths.

I hope these suggestions are helpful to you.