限制型拓扑结构的大学排课系统  

Topology-based Restrictions on the University Course Scheduling System

作　　者：宫玉晓[1] 张世伟[1] 刘海平[1] 

机构地区：[1]山东大学软件学院,济南250101

出　　处：《电脑编程技巧与维护》2009年第6期105-107,共3页Computer Programming Skills & Maintenance

摘　　要：通过使用拓扑排序原理对存在先行课关系的大学课程进行排序,可以得到每学期应该上的课程。引入堆栈,可以对学期数和每学期课程数有限制的大学课程进行排序,这就是限制型拓扑结构的排序。Sorting through the use of topology on the principle of the existence of the relationship between the first class sort of university courses, each semester should be on the course. The introduction of the stack, and the number of semester courses each semester there are few restrictions on the sort of university courses, which is limited topology of the sort.

关 键 词：拓扑排序 条件限制 排课系统 堆栈 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]