⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 e.c

📁 本程序是一个校园导游咨询系统
💻 C
字号:
#include<stdio.h>
#include<malloc.h>
#include<string.h>
#include<math.h>

#define infinity 100
#define MAX 4

typedef struct {
    char *name;
    char *info;
}vertex;
vertex ver[MAX]={{"dorm","ddd"},{"canteen","ccc"},{"supermarket","sss"},{"classroom","rrr"}};

int arcs[4][4]={
    {0,8,4,16},
    {8,0,2,infinity},
    {4,2,0,10},
    {16,infinity,10,0}
};

main()
{
    int i,j,k=10,t=10,k1,k2,r,min,m;char *name,*name2,*name3;char c;int d[MAX][MAX];
    int final[MAX];int p[MAX][MAX];
    printf("Command:");
    c=getchar();
    while(c!='q'&&c!='Q')
    {
        switch(c){
            case 'c':
            case 'C':
		getchar();i=0;
             printf("Input the name of the place:");
             do{
                    name[i++]=getchar();
             }while(name[i-1]!='\n');name[i-1]='\0';
             for(i=0;i<MAX;i++)
              {
                     if(!strcmp(name,ver[i].name))
                      k=i;
              }
             printf("\ninformation of the place:%s\n",ver[k].info);
	     printf("command:");
             c=getchar();break;
            case 'v':
            case 'V':
		{getchar();printf("Input two places:");i=0;
                do{name3[i++]=getchar();}while(name3[i-1]!=' ');name3[i-1]='\0';i=0;
                do{name2[i++]=getchar();}while(name2[i-1]!='\n');name2[i-1]='\0';

                 for(i=0;i<MAX;i++)
                 {
                   if(!strcmp(name2,ver[i].name))
                     t=i;
                 }
                 for(i=0;i<MAX;i++)
                 {
                   if(!strcmp(name3,ver[i].name))
                     k=i;
                 }

                 for(i=0;i<MAX;i++) {final[i]=0;d[k][i]=arcs[k][i];
                                     for(j=0;j<MAX;j++) p[i][j]=0;
                                      if(d[k][i]<infinity) {p[k][i]=1;p[i][i]=1;}}
                 d[k][k]=0;final[k]=1;
                 for(i=1;i<MAX;i++)
                 {
                     min=infinity;
                     for(j=0;j<MAX&&!final[t];j++)
                         if(!final[j])
                             if(d[k][j]<min){m=j;min=d[k][j];}
                     final[m]=1;
                     for(j=0;j<MAX;j++)
                     {
                         if(!final[j]&&(min+arcs[m][j]<d[k][j])){
                             d[k][j]=min+arcs[m][j];
                         for(r=0;r<MAX;r++) p[j][r]=p[m][r];p[j][j]=1;
                         }
                     }
                 }
               printf("distance:%d\n",d[k][t]);
               printf("the road:\n");
               for(j=0;j<MAX;j++){if(p[t][j]!=0) printf("%s ",ver[j].name);}
	       printf("\ncommand:");c=getchar();break;}
          default:exit(0);
             }
       }
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -