자료구조. C언어를 이용한 BST의 구현, Linked List, Queue의 구현, Process Scheduler구현

소개

C언어를 이용 자료구조 프로그래밍
- Linked List
- Queue
- Tree(BST)
작성한 자료구조를 이용하여 Process Scheduler의 구현과정 포함

목차

1. 개요 1
제작개요 1
제작기간 1
관련이론 1
설계 1
사용 Program / Tool 1

2. 설계 2
AddSubTree 순서도 2
DelSearchTree 순서도 3

3. Tree 5

4. Scheduling Program 12

5. Simulation 15

6. 결과 15

7. Appendix 18
Linked List 18
Queue 23

본문내용

□ 개요
○ 제작개요
• Dijkstras algorithm using adjacent matrix (15 point)
• Dijkstras algorithm using adjacent list (30 point)

○ 제작기간 : 6월 1일 ~ 6월 8일 24:00 (8일)

○ 설계주제
• [Level 1] Dijkstra`s algorithm using adjacent matrix (15 point)
Implement the Dijkstra`s algorithm using the adjacent matrix based on the codes in the textbook. The source files consist of graph.c, graph.h if needs, and input.h. You have to define following three things only in the input.h file:
1. MAX_VERTICES /* Maximum number of vertices */
2. MAX_WEIGHT /* Maximum weight for edges */
3. cost /* Adjacent matrix */
The value larger than MAX_WEIGHT (e.g., 1000 in the textbook) is used to represent the case that there is no edge between two vertices. You should note that the input.h file can be modified during the test phase after submission; therefore, if you do not follow the above instructions, the files will not be even compiled. In this case, your score for this assignment is zero.
The program gets the start vertex to find the shortest path from the user. The program outputs the simple paths from the start vertex to the others.

• [Level 2] Dijkstras algorithm using adjacent list (30 point)
Implement the Dijkstras algorithm using the adjacent list. The instructions for input.h is the same with Level 1. The program converts the adjacent matrix (i.e., cost) into the adjacent list. Then the program uses the adjacent list only in order to find the shortest path.

참고자료

· 없음