一种改进的Ford-Fulkenson算法在选题系统中的应用研究  

APPLIED RESEARCH OF AN IMPROVING FORD-FULKENSON ALGORITHM TO THE GRADUATION PROJECT OF SELECTION SYSTEM

作　　者：潘志方[1] 

机构地区：[1]温州医学院计算机系,浙江温州325035

出　　处：《计算机应用与软件》2007年第9期120-121,共2页Computer Applications and Software

摘　　要：介绍了经典的二分图的匹配算法Ford-Fulkenson,并作了改进,在毕业设计选题系统中进行了应用,能在学生的志愿和老师的要求之间进行自动匹配,使负责选题的工作人员能从冗杂的课题需求中尽量准确的达成匹配,从而提高院校的教学质量。In the paper,an algorithm of improving Ford-Fulkenson is introduced on using bipartite graph to make a mathematical model and to solve division between teachers and students in the selection system of graduation project. The matching method shortens the time and makes the staffer who is in charge of graduation project effortless, so that it raises the teaching quality of colleges.

关 键 词：毕业设计 二分图 匹配 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]