医院选址，要求最长往返路径最短

【代码】

#include <stdio.h>
#include <stdlib.h>
#define maxSize 100

typedef struct
{
	int edges[maxSize][maxSize];
	int n, e;//顶点数和边数
}MGraph;


//求数组元素中的最大值
int Max(int a[], int n)
{
	int i, k;

	k = 0;

	for (i = 1; i < n; ++i)
		if (a[i] > a[k])
			k = i;

	return a[k];
}

//求数组元素之和
int Sum(int a[], int n)
{
	int s, i;

	s = 0;

	for (i = 0; i < n; ++i)
		s += a[i];

	return s;
}

//弗洛伊德算法求最短路径矩阵A，A中存储了任意一对顶点之间的最短路径
void Floyd(MGraph g, int A[][maxSize])
{
	int i, j, k;

	//初始化矩阵A图g的邻接矩阵
	for (i = 0; i < g.n; ++i)
		for (j = 0; j < g.n; ++j)
			A[i][j] = g.edges[i][j];

	//以k为中间点，对所有的顶点对(i,j)进行检测和修改
	for (k = 0; k < g.n; ++k)
		for (i = 0; i < g.n; ++i)
			for (j = 0; j < g.n; ++j)
				if (A[i][j] > A[i][k] + A[k][j])
					A[i][j] = A[i][k] + A[k][j];
}

//医院选址，返回最佳结点编号
int Location(MGraph g)
{
	int A[maxSize][maxSize];//A中存储了任意一对顶点之间的最短路径
	int B[maxSize][maxSize];//B中存储了任意一对顶点的往返路径之和
	int mazDist[maxSize];//maxDist[i]表示顶点i距其他各顶点的最长往返路径
	int i, j;

	Floyd(g, A);

	for (i = 0; i < g.n; ++i)
		for (j = 0; j > g.n; ++j)
			B[i][j] = A[i][j] + A[j][i];

	for (i = 0; i < g.n; ++i)
		mazDist[i] = Max(B[i], g.n);

	int min=0;
	for (i = 1; i < g.n; ++i)
		if (mazDist[i] < mazDist[min])
			min = i;
		else if(mazDist[i]==mazDist[min])
		{
			int s1, s2;
			s1 = Sum(B[i], g.n);
			s2 = Sum(B[min], g.n);

			if (s1 < s2)
				min = i;
		}

	return min;
}