校园导航-_数据结构课程设计

#define MAX_VERTEX_NUM 40
#define MAX 40
#include<stdlib.h>
#include<stdio.h>
#include<conio.h>
#include<string.h>
typedef struct ArCell
{
int adj;
}ArCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
typedef struct
{
char name[30];
int num;
char introduction[100];
}infotype;
typedef struct
{
infotype vexs[MAX_VERTEX_NUM];
AdjMatrix arcs;
int vexnum,arcnum;
}MGraph;
MGraph b;
void cmd(void);
MGraph InitGraph(void);
void Menu(void);
void Browser(MGraph *G);
void ShortestPath_DIJ(MGraph * G);
void Floyd(MGraph *G);
void Search(MGraph *G);
int LocateVex(MGraph *G,char* v);
MGraph * CreatUDN(MGraph *G);
void print(MGraph *G);
/******************************************************/
void main(void)
{
system("color 1f");
system("mode con: cols=140 lines=130");
cmd();
}
/******************************************************/

void cmd(void)
{
int i;
b=InitGraph();
Menu();
scanf("%d",&i);
while(i!=5)
{
switch(i)
{
case 1:system("cls");Browser(&b);Menu();break;
case 2:system("cls");ShortestPath_DIJ(&b);Menu();break;
case 3:system("cls");Floyd(&b);Menu();break;
case 4:system("cls");Search(&b);Menu();break;
case 5:exit(1);break;
default:printf("error");
}

scanf("%d",&i);
}
}
MGraph InitGraph()
{
MGraph G;
int i,j;
G.vexnum=10;
G.arcnum=14;
for(i=0;i<G.vexnum;i++)
G.vexs[i].num=i;
strcpy(G.vexs[0].name,"yidaomen");
strcpy(G.vexs[0].introduction,"xuexiaozhengmen");
strcpy(G.vexs[1].name,"zhulou");
strcpy(G.vexs[1].introduction,"laoshigogngzuodedifang");
strcpy(G.vexs[2].name,"18haolou");
strcpy(G.vexs[2].introduction,"xueshengzhusudifang");
strcpy(G.vexs[3].name, "erlongshan");
strcpy(G.vexs[3].introduction, "yizuohenpiaoliangdishan");
strcpy(G.vexs[4].name, "tushuguan");
strcpy(G.vexs[4].introduction, "xueshengzixidedifang");
strcpy(G.vexs[5].name, "yishitang");

strcpy(G.vexs[5].introduction, "quantishishengjiucandedifang");
strcpy(G.vexs[6].name, "zhongbeijiudian");
strcpy(G.vexs[6].introduction, "xuexiaozuihaodefandian");
strcpy(G.vexs[7].name,"keyiyuan ");
strcpy(G.vexs[7].introduction,"xuexiaoyanchudedifang");
strcpy(G.vexs[8].name, "yiyuan");
strcpy(G.vexs[8].introduction, "xuexiaodeyiyuan");
strcpy(G.vexs[9].name,"chezhan");
strcpy(G.vexs[9].introduction,"xuexiaogongchedezhantai");
for(i=0;i<G.vexnum;i++)
for(j=0;j<G.vexnum;j++)
G.arcs[i][j].adj=1000000;
G.arcs[0][1].adj=100;
G.arcs[0][2].adj=300;
G.arcs[0][6].adj=400;
G.arcs[1][7].adj=500;
G.arcs[2][3].adj=120;
G.arcs[3][6].adj=200;
G.arcs[3][4].adj=100;
G.arcs[4][5].adj=300;
G.arcs[4][9].adj=450;
G.arcs[5][9].adj=350;
G.arcs[6][7].adj=20;
G.arcs[6][9].adj=500;
G.arcs[7][8].adj=100;
G.arcs[8][9].adj=300;
for(i=0;i<G.vexnum;i++)
for(j=0;j<G.vexnum;j++)
G.arcs[j][i].adj=G.arcs[i][j].adj;
return G;
}
void Menu()
{
printf("/n zhongbeidaxuedaohang/n");
printf("                                            /n");
printf(" 1.liulanxuexiao /n");
printf(" 2.chakanluxian /n");
printf(" 3.xuanzechufadianhemudidi /n");
printf(" 4.chakanjingdian/n");
printf(" 5.tuichu /n");
printf("                                            /n");
printf("Option-:");
}
void Browser(MGraph *G)                                    浏览
{
int v;
printf("                                                              /n");
printf("bianhao  jingdianmingcheng   jieshao  /n");
for(v=0;v<G->vexnum;v++)
printf(" %-4d  %-16s     %-56s    /n",G->vexs[v].num,G->vexs[v].name,G->vexs[v].introduction);
printf("                                                              /n");
}

void ShortestPath_DIJ(MGraph * G)
{
int v,w,i,min,t=0,x,flag=1,v0;
int final[20], D[20], p[20][20];
while(flag)
{
printf("qingshuruqishidian bianhao:");
scanf("%d",&v0);
if(v0<0||v0>G->vexnum)
{
printf("bianhaobucunzai,qingchongxinshuru:");
scanf("%d",&v0);
}
if(v0>=0&&v0<G->vexnum)
flag=0;
}
for(v=0;v<G->vexnum;v++)
{
final[v]=0;
D[v]=G->arcs[v0][v].adj;

for(w=0;w<G->vexnum;w++)
p[v][w]=0;
if(D[v]<10000)
{
p[v][v0]=1;p[v][v]=1;
}
}
D[v0]=0;final[v0]=1;
for(i=1;i<G->vexnum;i++)
{
min=10000;
for(w=0;w<G->vexnum;w++)
if(!final[w])
if(D[w]<min){v=w;min=D[w];}
final[v]=1;
for(w=0;w<G->vexnum;w++)
if(!final[w]&&(min+G->arcs[v][w].adj<D[w]))
{
D[w]=min+G->arcs[v][w].adj;
for(x=0;x<G->vexnum;x++)
p[w][x]=p[v][x];
p[w][w]=1;
}
}
for(v=0;v<G->vexnum;v++)
{
if(v0!=v) printf("%s",G->vexs[v0].name);
for(w=0;w<G->vexnum;w++)
{
if(p[v][w]&&w!=v0) printf("-->%s",G->vexs[w].name);
t++;
}
if(t>G->vexnum-1&&v0!=v)printf(" zongluxianchang%dm/n/n",D[v]);
}

}
void Floyd(MGraph *G)
{
int v,u,i,w,k,j,flag=1,p[10][10][10],D[10][10];
for(v=0;v<G->vexnum;v++)
for(w=0;w<G->vexnum;w++)
{
D[v][w]=G->arcs[v][w].adj;
for(u=0;u<G->vexnum;u++)
{p[v][w][u]=0;}
if(D[v][w]<10000)
{
p[v][w][v]=1;p[v][w][w]=1;
}
}
for(u=0;u<G->vexnum;u++)
for(v=0;v<G->vexnum;v++)
for(w=0;w<G->vexnum;w++)
if(D[v][u]+D[u][w]<D[v][w])
{
D[v][w]=D[v][u]+D[u][w];
for(i=0;i<G->vexnum;i++)
p[v][w][i]=p[v][u][i]||p[u][w][i];
}

while(flag)
{
printf("qingshuru chufadian he mudidide bianhao:");
scanf("%d%d",&k,&j);
if(k<0||k>G->vexnum||j<0||j>G->vexnum)
{
printf("jingdianbianhaobucunzai,qinchongxinshuru:");
scanf("%d%d",&k,&j);
}
if(k>=0&&k<G->vexnum&&j>=0&&j<G->vexnum)
flag=0;
}
printf("%s",G->vexs[k].name);
for(u=0;u<G->vexnum;u++)
if(p[k][j]&&k!=u&&j!=u)
printf("-->%s",G->vexs[u].name);
printf("-->%s",G->vexs[j].name);
printf(" zongluxianchang%dm/n",D[k][j]);
}
void Search(MGraph *G)
{
int k,flag=1;
while(flag)
{
printf("qingshuruyaochadejingdian bianhao:");
scanf("%d",&k);
if(k<0||k>G->vexnum)
{
printf("jibgdiabianhaobucunzai,qing chongxinshuru:");
scanf("%d",&k);
}
if(k>=0&&k<G->vexnum)
flag=0;
}
printf("                                                                            /n");
printf(" bianhao  jingdianmingcheng   jieshao /n");
printf(" %-4d  %-16s  %-56s  /n",G->vexs[k].num,G->vexs[k].name,G->vexs[k].introduction);
printf("                                                                            /n");

}
int LocateVex(MGraph *G,char* v)
{
int c=-1,i;
for(i=0;i<G->vexnum;i++)
if(strcmp(v,G->vexs[i].name)==0)
{c=i;break;}
return c;
}
MGraph * CreatUDN(MGraph *G)
{
int i,j,k,w;
char v1[20],v2[20];
printf("qingshurudingdianshu,hushu:");
scanf("%d%d",&G->vexnum,&G->arcnum);
printf("qingshurujingdiande bianhao:mingcheng jianjie:/n");
for(i=0;i<G->vexnum;i++)
{
printf("jingdianbianhao:");
scanf("%d",&G->vexs->num);
printf("jingdianmingcheng:");
scanf("%s",G->vexs[i].name);
printf("jingdianjianjie:");
scanf("%s",G->vexs->introduction);
}
for(i=0;i<G->vexnum;i++)
for(j=0;j<G->vexnum;j++)
G->arcs[i][j].adj=10000;
printf("qingshurulujingchangdu:/n");
for(k=0;k<G->arcnum;k++)
{
printf("di%d tiaobian:/n",k+1);
printf("jingdianduei(x,y):");
scanf("%s",v1);
scanf("%s",v2);
printf("changdu:");
scanf("%d",&w);
i=LocateVex(G,v1);
j=LocateVex(G,v2);
if(i>=0&&j>=0)
{
G->arcs[i][j].adj=w;
G->arcs[j][i]=G->arcs[i][j];
}
}
return G;
}

 

void print(MGraph *G)
{
int v,w,t=0;
for(v=0;v<G->vexnum;v++)
for(w=0;w<G->vexnum;w++)
{ if(G->arcs[v][w].adj==10000)
printf(" wuqiongda ");
else printf("%-7d",G->arcs[v][w].adj);
t++;
if(t%G->vexnum==0)
printf("/n");
}
}