求二分图的最大匹配m,如果m==p(课程数),就符合要求,不一定每个学生都要represent一门课程(a student can represent a course if he/she visits that course)
代码:
求二分图的最大匹配m,如果m==p(课程数),就符合要求,不一定每个学生都要represent一门课程(a student can represent a course if he/she visits that course)
代码: