课程安排，用拓扑排序实现

4、实现课程的拓扑排序。(选)（加）

问题描述：软件专业的学生要学习一系列课程，其中有些课程必须在其先修课程完成后才能学习，具体关系见下表：

课程编号 课程名称 先决条件

C1 程序设计基础 无

C2 离散数学 C1

C3 数据结构 C1，C2

C4 汇编语言 C1

C5 操作系统 C3

假设每门课程的学习时间为一学期，试为该专业的学生设计教学计划，使他们能在最短的时间内修完这些课程。-curriculum, using topological sorting achieve four to achieve the topological sorting courses. (EAC) (Canada) Problem descr iption : software professional students to study a series of courses Some of the programs must, in its prevocational courses can be completed after the study, the specific relationship between the table below : Curriculum prerequisite for the design procedures based on C1-C2 C3 Discrete Mathematics C1 C1 data structure, C2 C1 C4 C5 assembly language operating system C3 assumptions each course of study for a semester, Examination for Professional Teaching students design plans so that they can in the shortest time got these courses.