📜  每项工作的分配问题 k 人 - 任何代码示例

📅  最后修改于: 2022-03-11 14:55:28.232000             🧑  作者: Mango

代码示例1
You make a bipartite graph between people and jobs 
(like in the Hungarian algorithm), 
where the cost on the middle edges are the preference scores, 
and the capacity is 1. 
The capacity of the edges from the jobs to the sink is the number 
of people you need for that job