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; /学分上限/* -图的邻接表存储表示- */type
2、def 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, arcn
3、um; / 图的当前顶点数和弧数ALGraph; void OUTPUT() int s; printf(tt 教学计划编制菜单 nn); 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 | C3 n); printf(ttC8 | C3，C6 n); printf(ttC9 | 无 n); printf(tt
4、C10 | C9 n); printf(ttC11 | C9 n); printf(ttC12 | C9,C10,C1 n); printf(tt请按下任何键并回车以继续.); scanf(%d,&s);/* 查找图中某个顶点位置 */int LocateVex(ALGraph G, VertexType u) int i; for (i = 0;i G.vexnum;+i) if (strcmp(u,G.verticesi.data)=0) return i; return -1;/*采用邻接表存储结构*/int CreateGraph(ALGraph &G) int i, j, k; Ve
5、rtexType va; ArcNode *p; printf(请输入教学计划的课程总数:n ); scanf(%d,&G.vexnum); printf( 请输入各个课程的先修课程的总和(弧总数): n); scanf(%d,&G.arcnum); printf( 请输入%d个课程的课程号(最多%d个字符,字母+数字):n 请按ENTER键继续.n, G.vexnum,MAX_NAME); for (i = 0;i G.vexnum;+i) scanf(%s,&G.verticesi.data); G.verticesi.firstarc = NULL; printf(请输入%d个课程的学分
6、值:n 请按ENTER键继续.n,G.vexnum); for (i = 0;i G.vexnum;+i) scanf(%d,&G.verticesi.grades); printf(请依次输入下列课程的先修课程n（若该课程无先修课程请输入0 ，该课程输入结束后也输入0 )n 请按ENTER键继续.n); for (k=0;kadjvex = j; p-nextarc = G.verticesi.firstarc; / 插在表头 G.verticesi.firstarc = p; scanf(%s,va); return OK;/* 输出图G的信息*/void Display(ALGraph
7、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, int indegree) int i; ArcNode *p; for (i
8、= 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( C01); if(strcmp(str,name1.c)=0) printf( C02); if(strcmp(str,name2.c)=0) printf( C03); if(strcmp(str,name3.c)=0) pri
9、ntf( C04 ); if(strcmp(str,name4.c)=0) printf( C05 ); if(strcmp(str,name5.c)=0) printf( C06); if(strcmp(str,name6.c)=0) printf( C07); if(strcmp(str,name7.c)=0) printf( C08 ); if(strcmp(str,name8.c)=0) printf( C09); if(strcmp(str,name9.c)=0) printf( C10); if(strcmp(str,name10.c)=0) printf( C11); if(st
10、rcmp(str,name11.c)=0) printf( C12);/ /*栈定义*/typedef int SElemType; / 栈类型#define Stack_NUM 20 /存储空间初始分配量#define Stack_MoreNUM 5 / 存储空间分配增量typedef struct SqStack SElemType *base; SElemType *top; int stacksize; /分配的存储空间SqStack;/*栈的初始化*/int InitStack(SqStack &S) S.base = (SElemType *)malloc(Stack_NUM *
11、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 ERROR; e = *-S.top; return OK;/*入栈*/int Push(SqStack &S, SE
12、lemType 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;/*拓扑排序*/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 G.vexnum;+i) /建零入度顶点栈S if (!indegreei) Push(S, i); / 入度为0者进栈 count = 0; / 对输出顶点
