匈牙利算法，用于求解二分图的匈牙利算法，里面包含量两种求解方法，希望对大家有用。(Hungarian algorithm can be used to solve the bipartite matching problem , but it requires the bipartite graph to be completely symmetric. Hence we need to transform the original non-symmetric binary map matching problem into an absolute symmetric one.)