Research On Course Arranging System For A University Based On Graph Theory

Course arranging is one of the most important and complex work of schooleducational management. Course arranging is the timetable problem.The process ofcourse scheduling is an organic combination following certain constraints with the timeand place no conflicting. Course arranging is a typical combinatorial optimization. In1976, S.Even and others have proved that course arranging problem is a NP problem,although there have been research, still have no good solution. In this paper, using graphtheory to course arranging system optimization research has theoretical and practicalsignificance.This article takes Chongqing Vocational and Technical College for example,proposes the curriculum priority, makes the professional basic courses and others ahigher priority. and by the analysis of characters of some higher education, puts forwardthat a college course must considers the charactes of the same teaching classroom nofixed and basic course, compulsory course priority scheduling, and according to thesetwo features, the university course arranging problem is transformed into a graph theorymodel, studies a new algorithm about the coloring theory and analysises the complexity.In order to study the effectiveness of the algorithm, through the computerrealization, compares the algorithm in the course arranging system and the originalcourse arranging system for scheduling results,the course experiment verifies thevalidity of the method.