NOJ数据结构实验009——用迪杰斯特拉算法求赋权图中的最短路径

本题是以上一道题为基础的提高，但我们需要求出给出的最短路径，需要多设置一个数组TargetPath记录每一点的最优前驱(即在源点到该点的最短路径上该点前面紧邻的那个点)。

代码：

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

#define MAX_VER_NUM 20


typedef struct {
	int vertex[MAX_VER_NUM];
	int weight[MAX_VER_NUM][MAX_VER_NUM];
	int num_vex;//弧的个数用不上
}AdjMatrix;

typedef struct {
	int visited[MAX_VER_NUM];
	int length[MAX_VER_NUM];
}Path;

int TargetPath[MAX_VER_NUM];//记录所求路径

AdjMatrix* CreateMatrix(int n);   //构建邻接矩阵
void InitPath(AdjMatrix A, Path* dist, int start);   //初始化dist数组
int JudgePath(AdjMatrix A, Path* dist);   //判断是否遍历完成
int FindMinPath(AdjMatrix A, Path* dist);     //寻找最短路径的位置
void UpdatePath(AdjMatrix A, Path* dist, int pos_minpath);   //更新路径
void dijsktra(AdjMatrix A, Path* dist, int start);
//dijsktra算法并将所需路径存放在target中
void PrintDist(AdjMatrix A, int start, int end);   //打印数据

int main()
{
	int n, start, end;
	scanf("%d", &n);
	AdjMatrix* A;
	A = CreateMatrix(n);
	scanf("%d%d", &start, &end);
	Path dist;
	dijsktra(*A, &dist, start);
	//Print(A,start,end);
	PrintDist(*A, start, end);
	return 0;
}

AdjMatrix* CreateMatrix(int n)
{   //构建邻接矩阵
	AdjMatrix* A;
	A = (AdjMatrix*)malloc(sizeof(AdjMatrix));
	if (A == NULL) {
		return NULL;
	}
	A->num_vex = n;
	for (int i = 0; i < A->num_vex; i++) {
		for (int j = 0; j < A->num_vex; j++) {
			scanf("%d", &A->weight[i][j]);
		}
	}
	return A;
}

void InitPath(AdjMatrix A, Path* dist, int start)
{   //初始化dist数组
	for (int i = 0; i < A.num_vex; i++) {
		dist->visited[i] = -1;
		dist->length[i] = 10000;
	}
	for (int i = 0; i < A.num_vex; i++) {
		if (A.weight[start][i] != 10000) {
			dist->visited[i] = 1;
			dist->length[i] = A.weight[start][i];
			TargetPath[i]=start;
		}
	}
	dist->visited[start] = 0;
}

int JudgePath(AdjMatrix A, Path* dist)
{   //判断是否遍历完成
	for (int i = 0; i < A.num_vex; i++) {
		if (dist->visited[i] == 1) {
			return 1;
		}
	}
	return 0;
}

int FindMinPath(AdjMatrix A, Path* dist)
{   //寻找最短路径的位置
	int min = 10000, tmp = -1;
	for (int i = 0; i < A.num_vex; i++) {
		if (dist->visited[i] == 1) {
			if (dist->length[i] < min) {
				min = dist->length[i];
				tmp = i;
			}
		}
	}
	return tmp;
}

void UpdatePath(AdjMatrix A, Path* dist, int pos_minpath)
{   //更新路径
	int minpath = dist->length[pos_minpath];
	dist->visited[pos_minpath] = 0;
	for (int i = 0; i < A.num_vex; i++) {
		if (A.weight[pos_minpath][i] != 10000) {
			if (dist->visited[i] == 1) {
				if (minpath + A.weight[pos_minpath][i] < dist->length[i]) {
					dist->length[i] = minpath + A.weight[pos_minpath][i];
					TargetPath[i] = pos_minpath;
				}
			}
			else if (dist->visited[i] == -1) {
				dist->visited[i] = 1;
				dist->length[i] = A.weight[pos_minpath][i] + minpath;
				TargetPath[i] = pos_minpath;
			}
		}
	}
}

void dijsktra(AdjMatrix A, Path* dist, int start)
{   //dijsktra算法并将所需路径存放在a中
	int pos_path;
	InitPath(A, dist, start);
	while (JudgePath(A, dist)) {
		pos_path = FindMinPath(A, dist);
		UpdatePath(A, dist, pos_path);

	}
}

void PrintDist(AdjMatrix A, int start, int end)
{   //打印数据
	int i, mid = end, tmp[MAX_VER_NUM];
	for (i = 0;; i++) {
		if (mid == start) {
			tmp[i] = start;
			break;
		}
		else {
			tmp[i] = mid;
			mid = TargetPath[mid];
		}
	}
	for (; i >= 0; i--) {
		printf("%d\n", tmp[i]);
	}
}