基于拓扑排序和边活动网的网络课程设置方案研究  

Research on Network Course Setting Based on the Topological Sort and Activity on Edge Network

作　　者：原民民[1] 刘春霞[2] 

机构地区：[1]山西水利职业技术学院信息工程系,山西运城044000 [2]太原科技大学电子信息工程学院,山西太原030024

出　　处：《菏泽学院学报》2012年第2期123-126,共4页Journal of Heze University

基　　金：山西省青年科技研究基金资助项目(2011021014-3)

摘　　要：网络教学虽然把学习过程留给学生自主安排,但也要达到让学生系统学习知识的目的.因此,课程设置仍然是网络教育一项重要的任务.传统的课程设置以人工为主,工作效率低.通过对顶点活动网的拓扑排序算法分析,在原有排序结果不稳定的基础上,增加了学时数限制条件,提出了一种适合网络教学的课程设置方案.In spite of making students themselves arrange learning process during onhne education, its also en- able students to acquire knowledge systemly. So an important task for online education is to set the course. The tra- ditional course was setted by manual -acting in the past, so it＇s very inefficiency. Through the analysis of topological sort algorithm based on activity on vertex network, we put forward a kind of new method to update the old＇ s by u- sing a constraint condition. This method can effectively improve the work for educational department.

关 键 词：网络教育 课程设置 拓扑排序 边活动网 

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