数据结构之图的使用案例

哈利波特的考试

题意理解：哈利波特带着一个物体去参加考试，监考老师会要求其将这个物体变为指定的其他物体。物体编号为1、2、3、4、5、6。将物体之间变换的难度作为图的路径长度，将物体作为图的顶点，建立无向图（Graph）。
那么哈利波特希望知道将哪一个物体带去，可以使他在考试最容易通过。在这里就是通过图的结构，首先找出每个顶点到其他顶点中的最长距离，然后再从中找出最短的那一个。
采用邻接矩阵的方式建立图，矩阵的下标表示顶点，矩阵的值表示长度。如G[1][2]=1，表示从1号物体（图的顶点）变为2号物体（图的顶点）的难度（图边的长度）为1。因为是无向图，故G[2][1]也为1。
函数BuildGraph()的作用是建立一个图，在图的建立过程中调用的CreateGraph()函数为建立一个无边的图，调用的InsertEdge()函数的作用是将边插入图中，形成最终上图所示的图的结构。函数FindAnimal()的作用就是找到最佳的物体并输出改物体和该物体最难变到其他物体的难度数。

#include<stdio.h>
#define INFINITY 65535
#define MaxVertexNum 100//最大顶点数

typedef int Vertex;//用顶点下标表示顶点
typedef int WeightType;//权值
//typedef int DataType;//顶点存储的数据类型

//边的定义
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];
};
typedef PtrToGNode MGraph;

MGraph CreateGraph(int VertexNum)
{
	Vertex V, W;
	MGraph Graph;
	Graph = (MGraph)malloc(sizeof(struct GNode));
	Graph->Nv = VertexNum;
	Graph->Ne = 0;
	for (V = 0; V < Graph->Nv; V++)
		for (W = 0; W < Graph->Nv; W++)
			Graph->G[V][W] = INFINITY;
	return Graph;
}

void InserEdge(MGraph Graph, Edge E)
{
	Graph->G[E->V1][E->V2] = E->Weight;
	Graph->G[E->V2][E->V1] = E->Weight;
}

MGraph BuildGraph()
{
	MGraph Graph;
	Edge E;
	//Vertex V;
	int Nv, i;
	MGraph CreateGraph(int VertexNum);
	void InserEdge(MGraph Graph, Edge E);
	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--;
			InserEdge(Graph, E);
		}
	}
	//for (V = 0; V < Graph->Nv; V++)
	//	scanf("%c", &(Graph->Data[V]));
	return Graph;
}

//bool Floyd(MGraph Graph,WeightType D[][MaxVertexNum],Vertex path[][MaxVertexNum])
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];
			//path[i][j]=-1
		}
	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];
					/*if (i == j && D[i][j] < 0)
						return false;
					path[i][j];*/
				}
	//return true;
}

WeightType FindMaxDist(WeightType D[][MaxVertexNum],Vertex i,int N)
{
	WeightType MaxDist;
	Vertex j;
	MaxDist = 0;
	for (j = 0; j < N; j++)
		if (i != j && D[i][j] > MaxDist)
			MaxDist = D[i][j];
	return MaxDist;
}

void FindAnimal(MGraph Graph)
{
	WeightType D[MaxVertexNum][MaxVertexNum], MaxDist, MinDist;
	Vertex Animal, i;
	WeightType FindMaxDist(WeightType D[][MaxVertexNum], Vertex i, int N);
	void Floyd(MGraph Graph, WeightType D[][MaxVertexNum]);

	Floyd(Graph, D);

	MinDist = INFINITY;
	for (i = 0; i < Graph->Nv; i++) {
		MaxDist = FindMaxDist(D, i, Graph->Nv);
		if (MaxDist == INFINITY) {
			printf("0\n");
			return;
		}
		if (MinDist > MaxDist) {
			MinDist = MaxDist;
			Animal = i + 1;
		}
	}
	printf("%d %d\n", Animal, MinDist);
}

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

	MGraph G = BuildGraph();
	FindAnimal(G);

	return 0;
}

输出结果：