校园导游系统(源码)
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<windows.h>
#define MAXVEX 30
#define INFINITY 32767
typedef struct
{
int num;
char name[30];
char build_describe[300];
}Vextype;
typedef struct
{
int arcs[MAXVEX][MAXVEX];
Vextype vex[MAXVEX];
int vexnum;
int arcnum;
}MGraph;
int Index(MGraph *G, char name[])
{
int i;
for (i = 0; i < G->vexnum; i++)
{
if (!strcmp(name, G->vex[i].name))
return i;
}
return -1;
}
void Creat(MGraph *G)
{
FILE *fp;
int i = 0,j = 0,k,m,index1,index2,weight;
char name1[30], name2[30];
fp=fopen("文件点.txt", "rt");
if (fp == NULL)
{
printf("文件为空,或者文件遭破坏,请呼叫工作人员。按任意退出...");
getchar();
exit(1);
}
while (fscanf(fp, "%s %s", G->vex[i].name,G->vex[i].build_describe) != EOF)
{
G->vex[i].num = i;
i++;
}
fclose(fp);
G->vexnum = i;
for (m = 0; m < G->vexnum; m++)
for (k = 0; k < G->vexnum; k++)
G->arcs[m][k] = INFINITY;
fp = fopen("文件边.txt", "rt");
if (fp == NULL)
{
printf("文件为空,或者文件遭破坏,请呼叫工作人员。按任意退出...");
getchar();
exit(1);
}
while (fscanf(fp, "%s %s %d", name1,name2,&weight) != EOF)
{
index1 = Index(G, name1);
index2 = Index(G, name2);
G->arcs[index1][index2] = weight;
G->arcs[index2][index1] = weight;
j++;
}
fclose(fp);
G->arcnum = j;
}
void Display(MGraph *G)
{
int i, j;
printf("校园各个路径的情况为:\n");
for (i = 0; i < G->vexnum; i++)
for (j = 0; j < i; j++)
{
if (G->arcs[i][j] != INFINITY)
printf("%s<------>%s:%10dm\n", G->vex[i].name, G->vex[j].name, G->arcs[i][j]);
}
}
void Search(MGraph *G)
{
system("cls");
char name[20];
int num, i, j;
printf("输入要查询地点:");
scanf("%s", name);
num = Index(G, name);
printf("%s 简介:%s\n", name, G->vex[num].build_describe);
for(i=0;i<G->vexnum;i++)
if (i == num)
{
for (j = 0; j < G->vexnum; j++)
{
if (G->arcs[i][j] != INFINITY)
{
printf("%s<------>%s:%10dm\n", G->vex[num].name, G->vex[j].name, G->arcs[i][j]);
}
}
}
}
void Dijkstra(MGraph *G, int start, int end, int dist[], int path[][MAXVEX