校园导航系统（北华大学吕磊，数据结构课程设计）

printf(\ i=LocateVertex(G,name1);//函数调用 j=LocateVertex(G,name2);

G->arcs[i][j].adj=weight;//给邻接矩阵赋权值 G->arcs[j][i].adj=G->arcs[i][j].adj;//权值交换 }

return 1; }

//*第二部分*// //保存图

void save_inf(AdjMatrix *G) { int i,j; FILE *fp; if((fp=fopen(\学校导游系统.txt\ { printf(\写文件出错,按任意键退出!\ getch(); exit(1); } fprintf(fp,\ for(i=0;ivexnum;i++) fprintf(fp,\ for(i=0;ivexnum;i++) for(j=0;jvexnum;j++) fprintf(fp,\ printf(\文件已保存，按任意键返回!\ getch(); }

//从制定磁盘中读取信息并存入图G AdjMatrix *read_inf() { AdjMatrix *G; int i,j; FILE *fp; fp=fopen(\学校导游系统.txt\ if(fp==NULL) { printf(\读文件出错,按任意键退出!\ getch(); exit(1); }

25

G=(AdjMatrix *)malloc(sizeof(AdjMatrix)); fscanf(fp,\ for(i=0;ivexnum;i++) fscanf(fp,\ for(i=0;ivexnum;i++) for(j=0;jvexnum;j++) fscanf(fp,\ fclose(fp); printf(\文件已读出,按任意键返回!\ getch(); return G; }

//景点查找

void GetVertex(AdjMatrix *G) {

char name[30]; int i,p=0; biao();

printf(\输入要查找的地点名:\ scanf(\

for(i=0;ivexnum;i++) if(strcmp(G->vertex[i].name,name)==0) { p=1; break; } if(p==0) { map(); printf(\抱歉,您查找的地址不存在!\ } else { map(); printf(\地点名:%s\\n简介:%s\ }

printf(\ printf(\是否继续查找? 1是 2否\\n请选择:\ scanf(\ if(i==1) { Sleep(10000);

26

system(\ GetVertex(G); } }

//密码登录 void mima() {

AdjMatrix G; int i;

char m[7];

printf(\请输入六位数的密码:\ for(i=0;i<6;i++) {

m[i]=getch(); printf(\ }

m[6]='\\0'; Sleep(1000);

if(strcmp(m,\ {

printf(\ ((`\\'-\\\ printf(\ ) - - (\ printf(\ / (o _ o) \\\\\ printf(\ \\\\ ( 0 ) /\ printf(\ '-.._'='_..-'_\ printf(\ printf(\密码'#'正确((_/ \ printf(\ #. ☆ ☆ ☆ #\

printf(\ '#.欢迎进入 !.#' \ printf(\ / '#. .#' \\\\ \ printf(\ \\\\'#. .#'/ /_ \ printf(\ Sleep(1000); system(\ printf(\╔════════════════╗\\n\ printf(\║ ****************************** ║\\n\ printf(\║ * * ║\\n\ printf(\║ * 是否创建导游图? * ║\\n\ printf(\║ * 1是 2否 * ║\\n\ printf(\║ * * ║\\n\ printf(\║ ****************************** ║\\n\ printf(\╚════════════════╝\\n\ printf(\请选择:\ scanf(\

27

if(i==1) {

createUDN(&G); save_inf(&G); } else { Sleep(1000); system(\ tuichu(); } } else { Sleep(1000); system(\

printf(\ \\\\\\\\\\\\|/// \ printf(\ \\\\\\\\ .-.- // \ printf(\ ( .@.@ ) \

printf(\ printf(\ printf(\ 密码输入错误! 请重新输入! printf(\ printf(\ mima(); } }

//求离第二个景点最近的点

List *second(AdjMatrix *G,int i,int j,List *L2 ) {

int visit[MAX_VERTEX_NUM ],p,k; List *L1,*L3;

L1=(List*)malloc(sizeof(List)); InitStack(L1);

L3=(List*)malloc(sizeof(List)); InitStack(L3);

for(k=0;kvexnum;k++) visit[k]=INFINITY; if(i==j) { push(L2,i);

28

|\|\|\