A definition of edge-matrix was given. And two algorithms for determining perfect matching Mi were proposed， of which the algorithm A is determined by using Δ（G）-edge coloring of edge-matrix K′2n, and the algorithm B to perfectly match Mi is determined by partitioning edge-matrix K′v into 2×2 sub matrix and also by solving n-1 perfect matching M′i of a complete graph Kn .The procedures of constructing round-robin tournament K(i)20 by using the algorithm A and using algorithm B were presented respectively.