Affect m students to n groups?
问题 I'd like to affect m groups (m ~ 20) of students to n projects (n ~ 6). There is an additional constraint : I can only affect beetween p (p ~ 4) to q (q ~ 6) groups to each project. Each group has to order the projects from the one it likes most to the worst. I've read I could use the Hungarian algorithm if m = n and I should use the Ford-Fulkerson algorithm or the Edmonds–Karp algorithm in the general case. Could you please help me to discern what will the graph be in my case ? I guess nodes