最短距离问题 数据结构与算法

#include<stdio.h> #include<malloc.h> #define OK 1; #define ERROR -1; typedef int Status; typedef long VRType; typedef int VertexType; typedef long ShortPathTable; #define FALSE 0 #define TRUE 1 typedef int SElemtype; //定义栈的数据类型 enum{A,B,C,D,E,F}; //===========栈的相关定义============ typedef struct //定义一个顺序栈 { SElemtype *base; SElemtype *top; int stacksize; }SqStack; typedef struct Path { int status; //指明路径建立状态 int LastEstablishedBy; //指出结点的最短路径的建立依据 }PathMatrix[6][6]; typedef struct { VRType adj; //结点的路径开销 }ArcCell,AdjMatrix[6][6]; typedef struct { VertexType vexs[6]; //顶点向量 AdjMatrix arcs; //邻接矩阵 int vexnum,arcnum; //vexnum为图的当前顶点数,arcnum为图的当前边数 }MGraph; ShortPathTable DP[6]={9999,9999,9999,9999,9999,9999}; PathMatrix *P; MGraph *G; //=============初始化栈============== Status InitStask(SqStack *S) { S->base=(SElemtype *)malloc(sizeof(SElemtype)); if(!S->base) return ERROR; S->top=S->base; S->stacksize=0; return OK; } //===============入栈================ Status Push(SqStack *S,SElemtype e) { SElemtype *p; S->top=(SElemtype *)realloc(S->top,1); //分配存储空间 if(!S->base) return ERROR; p=S->top-1; //top始终指向栈顶的上一个元素 *p=e; S->stacksize+=1; return OK; } //===============出栈================ Status Pop(SqStack *S,SElemtype *e) { SElemtype *p; if(S->base==S->top)