Abstract: In order to solve the maximum matching problem of bipartite graph, the concepts of layered network and reversed network order are proposed. On this basis, a layered network model and an algorithm are established. The algorithm is given the idea, steps, examples, analysis of time complexity. The general algorithms are summarized and given the comparison with layered network optimization algorithm. Experiments show that this algorithm is readable, easy to understand and put into operation, with super properties in solving large-scale problem. It also has a good performance with computational complexity.

Key words: bipartite graphs, maximal matching, layered network, reversed network order, breadth first

摘要： 为解决二部图最大匹配问题，提出了分层网络及网络逆序的概念，在此基础上建立了一种分层网络优化模型及其算法。给出了算法的思想、步骤、实例、时间复杂度分析，概述了求解二部图最大匹配问题的常见算法，与分层网络优化算法进行比较。实验验证，算法可读性强，易于理解和操作，在解决大规模二部图最大匹配问题时具有良好的性能。

关键词: 二部图, 最大匹配, 分层网络, 网络逆序, 广度优先