! Note: using C language to sort the sequence of courses topologically, it also needs to be full of the total requirements of the Mathematical Olympiad of the course.
ask the hero for help, thank you in advance.
Design requirements
1. If there is a loop relationship between the input courses, there should be a loop error, and the re-input can be realized without the end of the program.
2. According to the course information and priority, the topological sequence of teaching plan is calculated.
3. When entering the sequence of courses, that is, when giving the arc tail and arc head of each arc, if the input arc tail or arc head is not in the course information list, you should be prompted to point out the error that the input arc tail or arc head is not in the course information list, and can be re-entered without the end of the program.
4. After inputting the information needed to build an AOV network, you can display its information, including the number of vertices, vertex names, arcs, arc information (arc tail-> arc head)
5, output the arrangement order of the teaching plan or give the error message prompt.
4 run and test
the test case takes the sequence of the nine courses described in the classroom as an example, the course-related information is shown in Table 1, and the AOV network is formed as shown in figure 1.
Table 1 related information table for each course
course code name preliminary course
C1 Advanced Mathematics
C2
C3 C1, C2
C4 C3, C2
C5 C2
C6 C5, C4
C7 C4, C9
C8 C1
C9 C8