基于优先级链表结构的大学排课算法设计与实现  

The design and realization of the university course scheduling algorithm based on the priority structure of linked list

作　　者：蒙焕念[1] 黄良永[1] 

机构地区：[1]柳州师范高等专科学校教务处,广西柳州545004

出　　处：《微型机与应用》2012年第21期14-16,19,共4页Microcomputer & Its Applications

基　　金：柳州师范高等专科学校科研基金项目(No.LSZ2008B005);广西教育厅科研面上项目(200911MS294)

摘　　要：针对计算机解决大学课程表问题的难点,提出使用优先级链表解决课表问题的贪心策略。该策略定义了特有的数据优先级权重,并以权重为基础生成排课数据的优先级链表,以优化设计编码,实现了一种基于链表操作的贪心排课算法。This paper talks about the difficulties of the university time table problems, and pruposes using a priority list of the greedy strategy to solve the schedule problems. In this strategy, a specific priority weight of data is defined, and has generated the priority linked list structure data of university course scheduling based on priority weight, in that case the code has been optimized and a course scheduling by means of the greedy algorithm based on linked list operations has been realized.

关 键 词：大学课程表 链表 贪心算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]