给出了计算无圈二分图的对应的矩阵的广义逆的求解方法,求所有最大匹配与所有SDR的算法,并给出了单圈二分图或者共圈二分图的矩阵广义逆的计算公式.
This paper derives a method of getting Moore-Penrose inverse of matrix corresponding to bipartite graph which has no circle, an algorithm to find all max-matching of a bipartite graph, an algorithm to find all SDR, and finally, a formula of Moore-Penrose inverse of matrix corresponding to the bipartite graph with one circle or more than one circles with same vertex.