#include"stdio.h"
#include"stdlib.h"
#define MAXVEX 20
#define FINITY 5000
typedef struct
{int vexs[MAXVEX]; //顶点类int arc[MAXVEX][MAXVEX]; //邻接矩阵int numVertexes;    //图中当前的顶点数和边数int numEdges;
} MGraph;typedef int Patharc[MAXVEX][MAXVEX];typedef int ShortPathTable[MAXVEX][MAXVEX];
void CreateMGraph(MGraph &G)          //这个是创建一个图函数
{int i, j, d, k;//d表示权重printf("学校重点地点有多少和边数：\n");scanf_s("%d", &G.numVertexes);//顶点scanf_s("%d", &G.numEdges); //边数printf("学校名称用序号表示为：\n");//输入顶点信息，建立顶点节点for (i = 0; i < G.numVertexes; i++){scanf_s("%d", &(G.vexs[i]));}//邻接矩阵初始化for (i = 0; i < G.numVertexes; i++){for (j = 0; j < G.numVertexes; j++){G.arc[i][j] = FINITY;}}//这里输入他们的之间的权重for (k = 0; k < G.numEdges; k++){printf("输入该建筑与下一个建筑序号以及之间的距离:\n");scanf_s("%d %d %d", &i, &j, &d);G.arc[i][j] = d;G.arc[j][i] = G.arc[i][j];}
}
void print(MGraph *mg) //这是打印第一个邻接表
{printf("初始化的邻接矩阵:\n");for (int i = 0; i < mg->numVertexes; i++){for (int j = 0; j < mg->numVertexes; j++)printf("%d\t", mg->arc[i][j]);printf("\n");}
}
void Floyd(MGraph G,Patharc *P, ShortPathTable *D)
{int v, w, k;for (v = 0; v < G.numVertexes; ++v){for (w = 0; w < G.numVertexes; ++w)(*D)[v][w] = G.arc[v][w];(*P)[v][w] = w;}for (k = 0; k < G.numVertexes; ++k){for (v = 0; k < G.numVertexes; ++v){for (w = 0; k < G.numVertexes; ++w){if ((*D)[v][w]>(*D)[v][k] + (*D)[k][w]){(*D)[v][w] = ((*D)[v][k] + (*D)[k][w]);(*P)[v][w] = (*P)[v][k];}}}}
}
int main()
{printf("*************************************\n");printf("*欢迎来到校园交通查询系统*\n");printf("*************************************\n");printf("*************************************\n");printf("*序号分别代表学校内的建筑*\n");printf("1.宿舍\n");printf("2.图书馆\n");printf("3.餐厅\n");printf("4.教学楼\n");printf("5.学校中央\n");printf("**************************************\n");int v, w, k;MGraph G;Patharc P;ShortPathTable D;CreateMGraph(G);//printf(&G);Floyd(G, &P, &D);printf("各建筑间最短路径如下：\n");for (v = 0; v < G.numVertexes; ++v){for (w = v + 1; w<G.numVertexes; w++){printf("v%d-v%d weight:%d ", v, w, D[v][w]);k = P[v][w];printf("path: %d", v);while (k != w){printf("-> %d", k);k = P[k][w];}printf("-> %d\n", w);}printf("\n");}printf("最短路径D\n");for (v = 0; v < G.numVertexes; ++v){for (w = 0; w < G.numVertexes; ++w){printf("%d\t", D[v][w]);}printf("\n");}return 0;}