数据结构PTA习题：进阶实验6-3.3 天梯地图 (30分)——Dijkstra算法

进阶实验6-3.3 天梯地图 (30分)

本题要求你实现一个天梯赛专属在线地图，队员输入自己学校所在地和赛场地点后，该地图应该推荐两条路线：一条是最快到达路线；一条是最短距离的路线。题目保证对任意的查询请求，地图上都至少存在一条可达路线。

输入格式：
输入在第一行给出两个正整数N（2 ≤ N ≤ 500）和M，分别为地图中所有标记地点的个数和连接地点的道路条数。随后M行，每行按如下格式给出一条道路的信息：

V1 V2 one-way length time

其中V1和V2是道路的两个端点的编号（从0到N-1）；如果该道路是从V1到V2的单行线，则one-way为1，否则为0；length是道路的长度；time是通过该路所需要的时间。最后给出一对起点和终点的编号。

输出格式：
首先按下列格式输出最快到达的时间T和用节点编号表示的路线：

Time = T: 起点 => 节点1 => … => 终点

然后在下一行按下列格式输出最短距离D和用节点编号表示的路线：

Distance = D: 起点 => 节点1 => … => 终点

如果最快到达路线不唯一，则输出几条最快路线中最短的那条，题目保证这条路线是唯一的。而如果最短距离的路线不唯一，则输出途径节点数最少的那条，题目保证这条路线是唯一的。
如果这两条路线是完全一样的，则按下列格式输出：

Time = T; Distance = D: 起点 => 节点1 => … => 终点

输入样例1：

10 15
0 1 0 1 1
8 0 0 1 1
4 8 1 1 1
5 4 0 2 3
5 9 1 1 4
0 6 0 1 1
7 3 1 1 2
8 3 1 1 2
2 5 0 2 2
2 1 1 1 1
1 5 0 1 3
1 4 0 1 1
9 7 1 1 3
3 1 0 2 5
6 3 1 2 1
5 3

输出样例1：

Time = 6: 5 => 4 => 8 => 3
Distance = 3: 5 => 1 => 3

输入样例2：

7 9
0 4 1 1 1
1 6 1 3 1
2 6 1 1 1
2 5 1 2 2
3 0 0 1 1
3 1 1 3 1
3 2 1 2 1
4 5 0 2 2
6 5 1 2 1
3 5

输出样例2：

Time = 3; Distance = 4: 3 => 2 => 5

题目是一个有权有向图。我用邻接矩阵存储图。用了两次Dijkstra算法分别求最快到达线路和最短距离线路。

C语言实现：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define Infinity 10000
struct graph //邻接矩阵存储图
{
	int Nv;
	int Ne;
	int * * Length;//距离
	int * * Time;//时间
};
typedef struct graph * Graph;
struct stack
{
	int top;
	int * st;
};
typedef struct stack * Stack;
Stack CreateStack(int N);
void Push(Stack S, int v);
int Pop(Stack S);
Graph CreateGraph(int N);
int * Collected;//判断顶点是否被收录
int main()
{
	int N, M;
	scanf("%d %d", &N, &M);
	Graph G;
	G = CreateGraph(N);
	G->Ne = M;
	Collected = (int *)malloc(N * sizeof(int));
	int v1, v2, t, le, ti;
	int i;
	for (i = 0; i < M; i++)
	{
		scanf("%d %d %d %d %d", &v1, &v2, &t, &le, &ti);
		if (t == 1)//单行线
		{
			G->Length[v1][v2] = le;
			G->Time[v1][v2] = ti;
		}
		else//双行线
		{
			G->Length[v1][v2] = le;
			G->Length[v2][v1] = le;
			G->Time[v1][v2] = ti;
			G->Time[v2][v1] = ti;
		}
	}
	int S, D;//S是起点，D是终点
	scanf("%d %d", &S, &D);
	int *dist1, *path1, *route1;
	int *dist2, *path2, *route2;
	dist1 = (int *)malloc(N * sizeof(int));
	path1 = (int *)malloc(N * sizeof(int));
	route1 = (int *)malloc(N * sizeof(int));
	dist2 = (int *)malloc(N * sizeof(int));
	path2 = (int *)malloc(N * sizeof(int));
	route2 = (int *)malloc(N * sizeof(int));
	
	//要求最快到达的情况
	//Dijkstra算法
	for (i = 0; i < N; i++)//初始化
	{
		dist1[i] = Infinity;
		path1[i] = -1;
		route1[i] = -1;
		Collected[i] = 0;
	}
	dist1[S] = 0;
	Collected[S] = 1;
	route1[S] = 0;
	for (i = 0; i < N; i++)
	{
		if (G->Time[S][i] < Infinity)
		{
			dist1[i] = G->Time[S][i];
			path1[i] = S;
			route1[i] = G->Length[S][i];
		}
	}
	int min, index = 0;
	while (1)
	{
		min = Infinity;
		int flag = 0;
		for (i = 0; i < N; i++)//找dist值最小的顶点
		{
			if (dist1[i] < min&&Collected[i] == 0)
			{
				flag = 1;
				min = dist1[i];
				index = i;
			}
		}
		if (flag == 0) { break; }
		Collected[index] = 1;//每次收录dist值最小的顶点
		for (i = 0; i < N; i++)
		{
			if (G->Time[index][i] < Infinity&&Collected[i] == 0)//未收录顶点中被收录的index顶点的邻接点若受影响，则更新
			{
				if (dist1[i] > dist1[index] + G->Time[index][i])
				{
					dist1[i] = dist1[index] + G->Time[index][i];
					path1[i] = index;
					route1[i] = route1[index] + G->Length[index][i];
				}
				else if (dist1[i] == dist1[index] + G->Time[index][i])//如果两条路线的最快时间相同，则更新为几条最快路线中最短的那条
				{
					if (route1[i] > route1[index] + G->Length[index][i])
					{
						path1[i] = index;
						route1[i] = route1[index] + G->Length[index][i];
					}
				}
			}
		}
	}

	//要求最短距离的情况
	//Dijkstra算法
	for (i = 0; i < N; i++)//初始化
	{
		dist2[i] = Infinity;
		path2[i] = -1;
		route2[i] = -1;
		Collected[i] = 0;
	}
	dist2[S] = 0;
	Collected[S] = 1;
	route2[S] = 1;
	for (i = 0; i < N; i++)
	{
		if (G->Length[S][i] < Infinity)
		{
			dist2[i] = G->Length[S][i];
			path2[i] = S;
			route2[i] = route2[S] + 1;
		}
	}
	while (1)
	{
		min = Infinity;
		int flag = 0;
		for (i = 0; i < N; i++)//找dist值最小的顶点
		{
			if (dist2[i] < min&&Collected[i] == 0)
			{
				flag = 1;
				min = dist2[i];
				index = i;
			}
		}
		if (flag == 0) { break; }
		Collected[index] = 1;//每次收录dist值最小的顶点
		for (i = 0; i < N; i++)
		{
			if (G->Length[index][i] < Infinity&&Collected[i] == 0)//未收录顶点中被收录的index顶点的邻接点若受影响，则更新
			{
				if (dist2[i] > dist2[index] + G->Length[index][i])
				{
					dist2[i] = dist2[index] + G->Length[index][i];
					path2[i] = index;
					route2[i] = route2[index] + 1;
				}
				else if (dist2[i] == dist2[index] + G->Length[index][i])//如果两条路线的最短距离相同，则更新为途经节点数最少的那条
				{
					if (route2[i] > route2[index] + 1)
					{
						path2[i] = index;
						route2[i] = route2[index] + 1;
					}
				}
			}
		}
	}

	int notsame = 0;//标记两条要输出的线路是否完全一样；完全一样notsame=0，不一样notsame=1
	i = D;
	while (path1[i] >= 0 && path2[i] >= 0)
	{
		if (path1[i] != path2[i])
		{
			notsame = 1;
		}
		i = path1[i];
	}
	if (!(path1[i] < 0 && path2[i] < 0)) { notsame = 1; }
	//输出最快到达路线
	if (notsame == 1)
	{
		printf("Time = %d: ", dist1[D]);
		Stack St1 = CreateStack(N);
		i = D;
		while (path1[i] >= 0)
		{
			Push(St1, i);
			i = path1[i];
		}
		printf("%d", S);
		while (St1->top != -1)
		{
			printf(" => ");
			int x = Pop(St1);
			printf("%d", x);
		}
		printf("\n");
	}
	else
	{
		printf("Time = %d; ", dist1[D]);
	}
	//输出最短距离的路线
	printf("Distance = %d: ", dist2[D]);
	Stack St2 = CreateStack(N);
	i = D;
	while (path2[i] >= 0)
	{
		Push(St2, i);
		i = path2[i];
	}
	printf("%d", S);
	while (St2->top != -1)
	{
		printf(" => ");
		int x = Pop(St2);
		printf("%d", x);
	}
	printf("\n");
	return 0;
}
Graph CreateGraph(int N)//创建图
{
	int i, j;
	Graph G;
	G = (Graph)malloc(sizeof(struct graph));
	G->Ne = 0;
	G->Nv = N;
	G->Length = (int * *)malloc(N * sizeof(int *));
	G->Time = (int * *)malloc(N * sizeof(int *));
	for (i = 0; i < N; i++)
	{
		G->Length[i] = (int *)malloc(N * sizeof(int));
		G->Time[i] = (int *)malloc(N * sizeof(int));
	}
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < N; j++)
		{
			G->Length[i][j] = Infinity;
			G->Time[i][j] = Infinity;
		}
	}
	return G;
}
Stack CreateStack(int N)//创建堆栈
{
	Stack S;
	S = (Stack)malloc(sizeof(struct stack));
	S->top = -1;
	S->st = (int *)malloc(N * sizeof(int));
	return S;
}
void Push(Stack S, int v)//压栈
{
	S->top++;
	S->st[S->top] = v;
}
int Pop(Stack S)//出栈
{
	return S->st[S->top--];
}