图的最短路径算法的实现

图的最短路径算法的实现C语言#include<stdio.h>#include<stdlib.h>#include<string.h>#define INF 32767#define MAXV 100#define BUFLEN 1024typedef struct{ char name[100];char info[1000];} VertexType;typedef struct{ VertexType vexs[10];int arcs[100][100];int vexnum,arcnum;} MGraph; //图结构char** getFile(char fileName[],char *array[],int &count){ FILE *file;char buf[BUFLEN];int len=0; //文件读取的长度file=fopen(fileName,"rt"); //打开graph.txt的信息if(file==NULL) //文件为空的处理办法{printf("Cannot open file strike any key exit!\n");exit(1);}while(fgets(buf,BUFLEN,file)){len=strlen(buf);array[count]=(char*)malloc(len+1);if(!array[count])break;strcpy(array[count++],buf);}fclose(file);return array;}void getInfo(int &vex,int &arc,char *array){char buf_ch[100];char *ch[100];char *tokenp;int str_count=0,str_len=0;tokenp=strtok(array," ");strcpy(buf_ch,tokenp);while(tokenp!=NULL){str_len=strlen(tokenp);ch[str_count]=(char*)malloc(str_len+1);strcpy(ch[str_count++],tokenp);tokenp=strtok(NULL," ");}for(int i=0;i<str_count;i++){if(i%2==1){ch[i][strlen(ch[i])-1]=0;sscanf(ch[i],"%d",&arc);}else{sscanf(ch[i],"%d",&vex);}}}MGraph setVertexTypeInfo(MGraph g,char *arrayVer[]){ int str_count=0;char buf_ch[100];char *ch[100];char *tokenp;for(int i=0;i<g.vexnum+1&&arrayVer[g.vexnum];i++){int str_len=0;tokenp=strtok(arrayVer[i]," ");strcpy(buf_ch,tokenp);while(tokenp!=NULL){str_len=strlen(tokenp);ch[str_count]=(char*)malloc(str_len+1);strcpy(ch[str_count++],tokenp);tokenp=strtok(NULL," ");}}for(int i1=2;i1<str_count;i1++){if(i1%2==1){ch[i1][strlen(ch[i1])-1]=0;strcpy(g.vexs[i1/2-1].info,ch[i1]);}else{strcpy(g.vexs[i1/2-1].name,ch[i1]);}}return g;}//设置无向图的基本信息MGraph setMGraphInfo(MGraph g,char *arrayMGraph[],int &count){ int str_count=0;char buf_ch[100];char *ch[100];char *tokenp;for(int i4=g.vexnum+1;i4<count;i4++){int str_len=0;tokenp=strtok(arrayMGraph[i4]," ");strcpy(buf_ch,tokenp);while(tokenp!=NULL){str_len=strlen(tokenp);ch[str_count]=(char*)malloc(str_len+1);strcpy(ch[str_count++],tokenp);tokenp=strtok(NULL," ");}}char *info[8];//需要匹配的字符串集合for(int i2=0;i2<g.vexnum;i2++){info[i2]=g.vexs[i2].name;}int G[50][50];//邻接矩阵初始化for(int i3=0;i3<g.vexnum;i3++)for(int j=0;j<g.vexnum;j++)G[i3][j]=INF;int temp[100]={0}; //存储距离信息int temp_count=0; //距离计数器int templeft[100]={0}; //起始地址的代号信息int templeft_count=0; //起始地址计数器int tempright[100]={0}; //终点地址的代号信息int tempright_count=0; //终点地址的计数器for(int k=0;k<str_count;k++){if(k%3==0){for(int m=0;m<g.vexnum;m++){if(strcmp(info[m],ch[k])==0){templeft[templeft_count++]=m;}}}else if(k%3==1){for(int m=0;m<g.vexnum;m++){if(strcmp(info[m],ch[k])==0){tempright[tempright_count++]=m;}}}else if(k%3==2){ch[k][strlen(ch[k])-1]=0;sscanf(ch[k],"%d",&temp[temp_count++]);}}for(int i5=0;i5<temp_count;i5++){G[templeft[i5]][tempright[i5]]=temp[i5];}for(int i6=0;i6<g.vexnum;i6++) //建立图的邻接矩阵for(int j=0;j<g.vexnum;j++){g.arcs[i6][j]=G[i6][j];}return g;}void DispMat(MGraph g){int i,j;for(i=0;i<g.vexnum;i++){for (j=0;j<g.vexnum;j++)if (g.arcs[i][j]==INF)printf(" %5s","∞");elseprintf(" %5d",g.arcs[i][j]);printf("\n");}}void ppath(MGraph g,int path[][MAXV],int i,int j){int k;k=path[i][j];if (k==-1) return;ppath(g,path,i,k);printf("%s->",g.vexs[k].name);ppath(g,path,k,j);}void DisPath(MGraph g,int A[][MAXV],int path[][MAXV],int i,int j) {if (A[i][j]==INF){if (i!=j)printf("从%s 到%s 没有路径\n",g.vexs[i].name,g.vexs[j].name);}else{printf("%s->",g.vexs[i].name);ppath(g,path,i,j);printf("%s",g.vexs[j].name);printf("\t路径长度为:%d\n",A[i][j]);}}void Floyd(MGraph g,int p,int q) //弗洛伊德算法{int A[MAXV][MAXV],path[MAXV][MAXV];int i,j,k,n=g.vexnum;for (i=0;i<n;i++)for (j=0;j<n;j++){A[i][j]=g.arcs[i][j];path[i][j]=-1;}for (k=0;k<n;k++){for (i=0;i<n;i++)for (j=0;j<n;j++){if (A[i][j]>(A[i][k]+A[k][j])){A[i][j]=A[i][k]+A[k][j];path[i][j]=k;}}}printf("最短路径为:\n");DisPath(g,A,path,p,q); //输出最短路径}int main(){int vex,arc;printf(" 欢迎来到江西理工大学\n");printf(" \n");MGraph g; //图的定义char *array[1]; //存储顶点和边数数据信息char *arrayVer[10]; //存储地点信息char *arrayMGraph[MAXV]; //存储关于图的信息int count=0;char fileName[]="D:\\数据结构\\shujujiegouyi\\graph.txt";getFile(fileName,array,count);//printf("%d\n",count);count=0;getInfo(vex,arc,array[0]);g.vexnum=vex;g.arcnum=arc;getFile(fileName,arrayVer,count);count=0;g=setVertexTypeInfo(g,arrayVer);getFile(fileName,arrayMGraph,count);g=setMGraphInfo(g,arrayMGraph,count);DispMat(g);printf(" 江西理工大学校园导向图\n\n");printf(" 功能选项：\n\n");printf(" 1.查看所有景点\n\n");printf(" 2.查询景点信息\n\n");printf(" 3.查询两个景点的最短路径\n\n");printf(" 4.退出校园导游\n\n");printf(" 返回到所有景点请输入9（功能3辅助）\n\n");int n=0,m=0,p=0,q=0,flag=0;int i7=0;while(n!=4){flag=scanf("%d",&n);while(flag!=1){ fflush(stdin);printf("对不起，您输入的有误，请重输入\n");flag=scanf("%d",&n);}switch(n){loop1: case 1:printf("校园的景点有：\n");for(i7=0;i7<g.vexnum;i7++){printf(" %d.%s\n",i7+1,g.vexs[i7].name);}printf("需要继续查询请选择功能选项，否则按4退出\n");break;loop2: case 2:printf("请选择您要查询的景点:(1-8)\n");flag=scanf("%d",&m);while(flag!=1){ fflush(stdin);printf("对不起，您输入的不是数字，请输入数字\n");flag=scanf("%d",&m);}if(m<9&&m>0){printf("%s的信息:%s\n",g.vexs[m-1].name,g.vexs[m-1].info);printf("需要继续查询请选择功能选项，否则按4退出\n");}else{printf("您输入的数字有误，请输入(1-8)\n");goto loop2;}break;case 3:printf("请输入您要查询第一个的景点:(1-8)\n");loop3: flag=scanf("%d",&p);while(flag!=1){ fflush(stdin);printf("对不起，您输入的不是数字，请输入数字\n");flag=scanf("%d",&p);}if(p==9){goto loop1;}if(p<9&&p>0){printf("请输入您要查询第二个的景点:(1-8)\n");}else{printf("您输入有误，请重新输入要查询的第一个景点(1-8)\n");goto loop3;}loop4: flag=scanf("%d",&q);while(flag!=1){ fflush(stdin);printf("对不起，您输入的数字有误，请输入数字(1-8)\n");flag=scanf("%d",&q);}if(q==9)goto loop1;if(q<9&&q>0){Floyd(g,p-1,q-1);printf("需要继续查询请选择功能选项，否则按4退出\n");}else{printf("您输入有误，请重新输入要查询的第二个景点(1-8)\n");goto loop4;}break;case 4: printf("欢迎再来\n"); break;default : printf("输入错误，请输入1-3的数字！\n");}}return 0;}。