Abstract: In this paper, the structure trait of a hypergraph corresponding to an optimal cover is analyzed based on the hypergraph and its classes of cycles discussed in3, 4,and 5. A polynomial-time algorithm to find optimal cover by replacing a simplified method is given.