compete（竞争）.docVIP

compete（竞争） # includes string.h # includes ctype.h # includes malloc.h / * malloc () 等 * / # includes limits.h / * int _ max等 * / # includes stdio.h / * eofl (= ^ z或f6), null * / # includes stdlib.h / * atoi () * / # includes io.h / * - eof () * / # includes math.h / * floor (), ceil (), abs () * / # includes process.h / * exit () * / / * 函数结果状态代码 * / # define true 1 # define false 0 # define okay 1 # define error 0 # define infeasible - 1 / * # define overflow - 2 因为在math.h中已定义overflow的值为3, 故去掉此行 * / typedef int status; / * status是函数的类型, 其值是函数结果状态代码, 如ok等 * / typedef int boolean; / * boolean是布尔类型, 其值是true或false * / # define max _ vertex _ num 20 # define max _ name 2 typedef int vrtype; typedef int infotype; typedef char telemtype; typedef struct { int path2 [100]. int paths [100]. int final [100]. int length; int flen; } mlist; typedef struct { int finallist [100]. int minlen; } flist; typedef char vertextype [max _ vertex _ num); / * 字符串类型 * / typedef struct bitnode { int date; struct lchild bitnode *, * * rchild, mparent 左右孩子指针; / * * / } bitnode, * bitree; typedef struct arcnode { int adjvex 该弧所指向的顶点的位置; / * * / struct arcnode * nextarc 指向下一条弧的指针; / * * / infotype info; / * 网的权值指针) * / arcnode 表结点}; / * * / typedef struct { 顶点信息 vertextype date; / * * / int adjnum; int covernum; int links; arcnode * firstarc; / * 第一个表结点的地址, 指向第一条依附该顶点的弧的指针 * / } vnode, adjlist [max _ vertex _ num); / * 头结点 * / typedef struct { int arch; int arct; } arce, archl [200]. typedef struct { archl but; adjlist vertices; adjlist minc; int vexnum, arcnum 图的当前顶点数和弧数; / * * / int kind 图的种类标志; / * * / } algraph; int locatevex (algraph g, vertextype u) {/ * 初始条件: 图g存在, u和g中顶点有相同特征 * / / * 操作结果: 若g中存在顶点u, 则返回该顶点在图中位置; 否则返回 - 1 * / int i; for (i = 0; i g.vexnum; + + i) if (strcmp (u, g.vertices [] date) = = 0) return i; return - 1; } status deletevex (algraph * g, vertextype v) {/ * 初始条件: 图g存在, v是g中某个顶点 * / / * 操作结果: 删除g中顶点v及其相关的弧 * / int i, j; arcnode * p * q; j = locatevex