摘要
文章针对高校排课系统的现状,转化教师、班级、教室之间的关系为集合关系,然后,从中建立两个二部图模型来解决:教师与上课班级的二部图;每节课与教室的二部图。第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。
To account present problems of college time-table system,this paper puts forward the conception of trans-forming the relation among teacher,grade,classroom into the relation among musters,then building bipartite graph mod-els to solve it:The bipartite graph between teachers and grades and the bipartite graph between lessons and classrooms .Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第4期221-222,256,共3页
Computer Engineering and Applications
