PTA哈利波特的考试

PTA哈利波特的考试 C语言

#include<stdio.h>
#include<stdlib.h>

#define MaxVertexNum 100  //最大顶点数设为100 
#define INFINITY 65535  //∞设为双字节无符号整数的最大值65535 
typedef int Vertex;  //用顶点下标表示顶点，为整型 
typedef int WeightType;  //边的权值设为整型 

//边的定义
typedef struct ENode *PtrToENode;
struct ENode
{
	Vertex V1,V2;//有向边<V1,V2> 
	WeightType Weight;//权重 
};
typedef PtrToENode Edge;
 
 //图节点的定义
typedef struct GNode *PtrToGNode;
struct GNode
{
	int Nv;//顶点数
	int Ne;//边数
	WeightType G[MaxVertexNum][MaxVertexNum];//邻接矩阵
	//DataType Data[MaxVertexNum];//存顶点的数据
	//注：顶点无数据时，Data可以不用出现 
};
typedef PtrToGNode MGraph;//以邻接矩阵存储的图类型 

void FindAnimal(MGraph Graph);
WeightType FindMaxDist(WeightType D[][MaxVertexNum],Vertex i,int N);
MGraph CreateGraph(int VertexNum);
void InsertEdge(MGraph Graph,Edge E);
MGraph BuildGraph();
void Floyd(MGraph Graph,WeightType D[][MaxVertexNum]);

int main()
{
	MGraph G=BuildGraph();
	FindAnimal(G);
	return 0;
}

void FindAnimal(MGraph Graph)
{
	WeightType D[MaxVertexNum][MaxVertexNum],MaxDist,MinDist;
	Vertex Animal,i;
	
	Floyd(Graph,D);
	
	MinDist=INFINITY;
	for(i=0;i<Graph->Nv;i++)
	{
		MaxDist=FindMaxDist(D,i,Graph->Nv);
		if(MaxDist==INFINITY)//说明有从i无法变出的动物 
		{
			printf("0\n");
			return;
		}
		if(MinDist>MaxDist)//找到最长距离更小的动物 
		{
			MinDist=MaxDist;//更新距离 
			Animal=i+1;//记录编号 
		}
	}
	printf("%d %d\n",Animal,MinDist);
}

WeightType FindMaxDist(WeightType D[][MaxVertexNum],Vertex i,int N)
{
	WeightType MaxDist;
	Vertex j;
	
	MaxDist =0;
	for(j=0;j<N;j++)//找出i到其他动物j的最长距离 
	{
		if(i!=j&&D[i][j]>MaxDist)
		{
			MaxDist=D[i][j];
		}
	}
	return MaxDist;
 } 

MGraph CreateGraph(int VertexNum)
{//初始化一个有VertexNum个顶点但没有边的图 
	Vertex V,W;
	MGraph Graph;
	
	Graph=(MGraph)malloc(sizeof(struct GNode));//建立图 
	Graph->Nv=VertexNum;
	Graph->Ne=0;
	//初始化邻接矩阵，顶点编号从0到Graph->Nv-1 
	for(V=0;V<Graph->Nv;V++)
	{
		for(W=0;W<Graph->Nv;W++)
		{
			Graph->G[V][W]=INFINITY;
		}
	}
	return Graph;
}

void InsertEdge(MGraph Graph,Edge E)
{
	//插入边<V1,V1>
	Graph->G[E->V1][E->V2]=E->Weight;
	//若是无向图，还要插入<V2,V1> 
	Graph->G[E->V2][E->V1]=E->Weight;
}

MGraph BuildGraph()
{
	MGraph Graph;
	Edge E;
	//Vertex V;
	int Nv,i;
	
	scanf("%d",&Nv);//读入顶点个数
	Graph=CreateGraph(Nv);
	
	scanf("%d",&Graph->Ne);//读入边数
	if(Graph->Ne!=0)//如果有边 
	{
		E=(Edge)malloc(sizeof(struct ENode));//建立边节点
		for(i=0;i<Graph->Ne;i++)//读入边，格式为“起点 终点 权重”，插入邻接矩阵 
		{
			scanf("%d %d %d",&E->V1,&E->V2,&E->Weight);
			E->V1--;E->V2--;//起点编号从0开始 
			InsertEdge(Graph,E);
		}
	}
	//如果顶点有数据的话，读入数据
	//for(V=0;V,Graph->Nv;V++0)
	//	scanf(" %c",&(Graph->Data[V])); 
	return Graph;
}

void Floyd(MGraph Graph,WeightType D[][MaxVertexNum])
{
	Vertex i,j,k;
	
	for(i=0;i<Graph->Nv;i++)//初始化 
	{
		for(j=0;j<Graph->Nv;j++)
		{
			D[i][j]=Graph->G[i][j];
		}
	}
	
	for(k=0;k<Graph->Nv;k++)
	{
		for(i=0;i<Graph->Nv;i++)
		{
			for(j=0;j<Graph->Nv;j++)
			{
				if(D[i][k]+D[k][j]<D[i][j])
				{
					D[i][j]=D[i][k]+D[k][j];
				}
			}
		}
	}
}