An algorithm for finding all perfect matchings in a given bipartite graph G(X,Y, E) is presented.

• 本文提出了一种求解这一问题的算法。