This Project is a practice for paper training, espacially for algorithms model training.
I finish the verification of algorithms with the paper's first author Prof.Tao Jia.
Find the maximum matching of the bipartite graph using the Hopcroft–Karp algorithm.
At last, We test the max matching algorithm.