数据结构教学计划编制1.docx

1、数据结构教学计划编制1主要设计程序#include#include#include#include#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define MAX_NAME 3#define MAXCLASS 100 /顶点字符串的最大长度#define MAX_VERTEX_NUM 100 /最大顶点数#define N 12typedef char VertexTypeMAX_NAME; int TotalTerms ; /学期总数int MaxScores; /学分上限/* -图的邻接表存储表示- */typedef

2、struct ArcNode int adjvex; / 该弧所指向的顶点的位置 弧的节点结构 struct ArcNode *nextarc; /指向下一条弧的指针ArcNode; / 链表结点typedef struct /链接表 VertexType data; /顶点信息 int grades; /存储学分信息 ArcNode *firstarc; /指向第一条依附该顶点的弧的指针VNode, AdjListMAX_VERTEX_NUM; / 头结点typedef struct AdjList vertices; /vertices 存储课程名 int vexnum, arcnum;

3、/ 图的当前顶点数和弧数ALGraph;void OUTPUT() int s; printf(tt 教学计划编制菜单 n); printf(tt课程代码 | 课程名称 |优先课程 n); printf(ttC1 |程序设计基础 | 无 n); printf(ttC2 |离散数学 | C1 n); printf(ttC3 |数据结构 | C1，C2 n); printf(ttC4 |汇编语言 | C1 n); printf(ttC5 |语言的设计和分析 | C3，C4 n); printf(ttC6 |计算机原理 | C11 n); printf(ttC7 |编译原理 | C5，C3 n);

4、printf(ttC8 |操作系统 | C3，C6 n); printf(ttC9 |高等数学 | 无 n); printf(ttC10 |线性代数 | C9 n); printf(ttC11 |普通物理 | C9 n); printf(ttC12 |数值分析 | C9,C10,C1 n); printf(press any num key to continue:); scanf(%d,&s);/* 查找图中某个顶点位置 */int LocateVex(ALGraph G, VertexType u) int i; for (i = 0;i G.vexnum;+i) if (strcmp(u

5、,G.verticesi.data)=0) return i; return -1;/*采用邻接表存储结构*/int CreateGraph(ALGraph &G) int i, j, k; VertexType va; ArcNode *p; printf(请输入教学计划的课程数: ); scanf(%d,&G.vexnum); printf( 请输入各个课程的先修课程的总和(弧总数): ); scanf(%d,&G.arcnum); printf( 请输入%d个课程的课程号(最多%d个字符,数字+字母):, G.vexnum,MAX_NAME); for (i = 0;i G.vexnum

6、;+i) scanf(%s,&G.verticesi.data); G.verticesi.firstarc = NULL; printf(请输入%d个课程的学分值:,G.vexnum); for (i = 0;i G.vexnum;+i) scanf(%d,&G.verticesi.grades); printf(请输入下列课程的先修课程(无先修课程输入0 结束后也输入0)n); for (k=0;kadjvex = j; p-nextarc = G.verticesi.firstarc; / 插在表头 G.verticesi.firstarc = p; scanf(%s,va); retu

7、rn OK;/* 输出图G的信息*/void Display(ALGraph G) int i; ArcNode *p; printf(有向图n); printf(%d个顶点, G.vexnum); for (i = 0;i G.vexnum;+i) printf(%4s, G.verticesi.data); printf( n%d条弧边:n,G.arcnum); for (i = 0;i %sn,G.verticesi.data,G.verticesp-adjvex.data); p = p-nextarc; /*求顶点的入度*/void FindInDegree(ALGraph G, i

8、nt indegree) int i; ArcNode *p; for (i = 0;i G.vexnum;i+) indegreei = 0; for (i = 0;i adjvex+; p = p-nextarc; struct Name char c20;name;void puanduan(VertexType str,struct Name name,int n) if(strcmp(str,name0.c)=0) printf( 程序设计基础); if(strcmp(str,name1.c)=0) printf( 离散数学); if(strcmp(str,name2.c)=0) p

9、rintf( 数据结构); if(strcmp(str,name3.c)=0) printf( 汇编语言 ); if(strcmp(str,name4.c)=0) printf( 语言的设计和分析 ); if(strcmp(str,name5.c)=0) printf( 计算机原理); if(strcmp(str,name6.c)=0) printf( 编译原理); if(strcmp(str,name7.c)=0) printf( 操作系统 ); if(strcmp(str,name8.c)=0) printf( 高等数学); if(strcmp(str,name9.c)=0) printf

10、( 线性代数); if(strcmp(str,name10.c)=0) printf( 普通物理); if(strcmp(str,name11.c)=0) printf( 数值分析);/ /*栈定义*/typedef int SElemType; / 栈类型#define Stack_NUM 20 /存储空间初始分配量#define Stack_MoreNUM 5 / 存储空间分配增量typedef struct SqStack SElemType *base; SElemType *top; int stacksize; /分配的存储空间SqStack;/*栈的初始化*/int InitSt

11、ack(SqStack &S) S.base = (SElemType *)malloc(Stack_NUM * sizeof(SElemType); if (!S.base) exit(-1); S.top =S.base; S.stacksize =Stack_NUM; return OK;/*判空*/int StackEmpty(SqStack S) if (S.top = S.base) return TRUE; else return FALSE;/*出栈*/int Pop(SqStack &S, SElemType &e) if (S.top = S.base) return ER

12、ROR; e = *-S.top; return OK;/*入栈*/int Push(SqStack &S, SElemType e) if (S.top - S.base = S.stacksize) S.base = (SElemType *) realloc ( S.base, (S.stacksize + Stack_MoreNUM) * sizeof(SElemType); if ( !S.base ) exit(-1); S.top =S.base +S.stacksize; S.stacksize +=Stack_MoreNUM; *S.top+ = e; return OK;/

13、*拓扑排序*/int TopoSort(ALGraph G,AdjList Temp,struct Name name) int i, k, j = 0, count, indegreeMAX_VERTEX_NUM; SqStack S; ArcNode *p; FindInDegree(G, indegree); / 对各顶点求入度 InitStack(S); / 初始化栈 for (i = 0;i nextarc)/ 对i号顶点的每个邻接点的入度减1 k = p-adjvex; if (!(-indegreek) / 若入度减为0,则入栈 Push(S, k); if (count G.v

14、exnum) printf(此有向图有回路无法完成拓扑排序); return ERROR; else printf( 为一个拓扑序列); printf(n); int q=1,Z=0; while (q = TotalTerms) int C = TempZ.grades ; printf(n第%d个学期应学课程:,q); while (C = MaxScores) C = C + TempZ+1.grades; if (Z G.vexnum) puanduan(TempZ.data,name,N); +Z; printf(n); if (q = TotalTerms)printf( n课程编

15、制完成!); q+; return OK;void main() ALGraph G; AdjList Temp; struct Name nameN=C1,C2,C3,C4,C5,C6,C7,C8,C9,C10,C11,C12; OUTPUT(); printf(*教学计划编制问题*n ); printf( 请输入学期总数:); scanf(%d,&TotalTerms); printf(请输入学期的学分上限:); scanf(%d,&MaxScores); CreateGraph(G); Display(G); TopoSort(G,Temp,name); printf(OKn); scanf(*c);