基于匈牙利算法的毕业论文选题分配的实现

Implementation of Graduation Thesis Topic Allocation Based on Hungarian Algorithm

针对传统高校大学生毕业论文选题分配存在的问题,提出将学生对论文题目的满意度量化为二分图匹配中的权值。首先,约束最多选题数目,设置满意度梯度值,将预选结果存储在二维矩阵中;其次,使用经典的匈牙利算法进行求解;最后,进行实验分析。实验结果表明,利用这种分配方式能达到较高的平均满意度和分配率。

In view of the problems existing in the traditional assignment of graduation thesis topics for college students,this paper proposes to quantify students'satisfaction with thesis topics as the weight value in the bipartite graph matching.Firstly,constrain the maximum number of topics,set the satisfaction gradient value,and store the pre-selection results in the two-dimensional matrix.Secondly,the classical Hungarian algorithm is used to solve the problem.Finally,experimental analysis is carried out.The experimental results show that using this distribution method can achieve higher average satisfaction and distribution rate.